Result 1 to 20 of 307 total
Kemnad: a knowledge engineering methodology for negotiating agent development. (English)
Comput. Intell. 28, No. 1, 51-105 (2012).
1
Infeasible constraint-reduced interior-point methods for linear optimization. (English)
Optim. Methods Softw. 27, No. 4-5, 801-825 (2012).
2
Succinct data structures for path queries. (English)
Epstein, Leah (ed.) et al., Algorithms ‒ ESA 2012. 20th annual European symposium, Ljubljana, Slovenia, September 10‒12, 2012. Proceeding. Berlin: Springer (ISBN 978-3-642-33089-6/pbk). Lecture Notes in Computer Science 7501, 575-586 (2012).
3
Succinct and I/O efficient data structures for traversal in trees. (English)
Algorithmica 63, No. 1-2, 201-223 (2012).
4
Succinct representation of labeled graphs. (English)
Algorithmica 62, No. 1-2, 224-257 (2012).
5
Stability analysis and stabilization for time-delay systems: a unified viewpoint of Finsler’s lemma. (Chinese)
Control Theory Appl. 28, No. 11, 1577-1582 (2011).
6
Improved absolute stability criteria for neutral systems with time-varying delay. (Chinese)
Control Decis. 26, No. 7, 1026-1030,1035 (2011).
7
Biswapped networks: a family of interconnection architectures with advantages over swapped or OTIS networks. (English)
Int. J. Comput. Math. 88, No. 13, 2669-2684 (2011).
8
Improved ID-based ring signature scheme with constant-size signatures. (English)
Informatica, Ljubl. 35, No. 3, 343-350 (2011).
9
$P$-top-$k$ queries in a probabilistic framework from information extraction models. (English)
Comput. Math. Appl. 62, No. 7, 2755-2769 (2011).
10
An identity-based smart card remote authenticated key agreement protocol for multi-servers. (Chinese)
J. Huazhong Univ. Sci. Technol. 39, No. 1, 36-40 (2011).
11
Dynamic range selection in linear space. (English)
Asano, Takao (ed.) et al., Algorithms and computation. 22nd international symposium, ISAAC 2011, Yokohama, Japan, December 5‒8, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-25590-8/pbk). Lecture Notes in Computer Science 7074, 160-169 (2011).
12
Dynamic range majority data structures. (English)
Asano, Takao (ed.) et al., Algorithms and computation. 22nd international symposium, ISAAC 2011, Yokohama, Japan, December 5‒8, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-25590-8/pbk). Lecture Notes in Computer Science 7074, 150-159 (2011).
13
Path queries in weighted trees. (English)
Asano, Takao (ed.) et al., Algorithms and computation. 22nd international symposium, ISAAC 2011, Yokohama, Japan, December 5‒8, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-25590-8/pbk). Lecture Notes in Computer Science 7074, 140-149 (2011).
14
A new similarity measure based robust possibilistic c-means clustering algorithm. (English)
Gong, Zhiguo (ed.) et al., Web information systems and mining. International conference, WISM 2011, Taiyuan, China, September 24‒25, 2011, Proceedings, Part II. Berlin: Springer (ISBN 978-3-642-23981-6/pbk). Lecture Notes in Computer Science 6988, 335-342 (2011).
15
False alarm probability of the digital channelized receiver based CA-CFAR detector. (English)
Gong, Zhiguo (ed.) et al., Web information systems and mining. International conference, WISM 2011, Taiyuan, China, September 24‒25, 2011. Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-23970-0/pbk). Lecture Notes in Computer Science 6987, 86-91 (2011).
16
Statistical inference in mixed models and analysis of twin and family data. (English)
Biometrics 67, No. 3, 987-995 (2011).
17
Finding frequent elements in compressed 2D arrays and strings. (English)
Grossi, Roberto (ed.) et al., String processing and information retrieval. 18th international symposium, SPIRE 2011, Pisa, Italy, October 17‒21, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-24582-4/pbk). Lecture Notes in Computer Science 7024, 295-300 (2011).
18
Adaptive combination of subband adaptive filters with selective partial updates. (English)
Deng, Hepu (ed.) et al., Artificial intelligence and computational intelligence. Third international conference, AICI 2011, Taiyuan, China, September 24‒25, 2011. Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-23880-2/pbk). Lecture Notes in Computer Science 7002. Lecture Notes in Artificial Intelligence, 204-211 (2011).
19
Space efficient data structures for dynamic orthogonal range counting. (English)
Dehne, Frank (ed.) et al., Algorithms and data structures. 12th international symposium, WADS 2011, New York, NY, USA, August 15‒17, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22299-3/pbk). Lecture Notes in Computer Science 6844, 500-511 (2011).
20
Result 1 to 20 of 307 total
Start
Contact
Print
General Help
