5316 search results - page 278 / 1064 » Which Search Problems Are Random |
142
click to vote
TSMC
2002
15 years 4 months ago
2002
Many problems in practically all fields of science, engineering and technology involve global optimization. It becomes more and more important to develop the efficient global opti...
155
click to vote
ATAL
2009
Springer
15 years 11 months ago
2009
Springer
Distributed Constraint Optimization (DCOP) is useful for solving agent-coordination problems. Any-space DCOP search algorithms require only a small amount of memory but can be spe...
276
Voted
ICDE
2009
IEEE
16 years 6 months ago
2009
IEEE
A common approach to performing keyword search over relational databases is to find the minimum Steiner trees in database graphs. These methods, however, are rather expensive as th...
152
click to vote
DNIS
2010
Springer
15 years 12 months ago
2010
Springer
The class of k Nearest Neighbor (kNN) queries in spatial networks is extensively studied in the context of numerous applications. In this paper, for the first time we study a gene...
139
click to vote
APSEC
2005
IEEE
15 years 10 months ago
2005
IEEE
In typical open source software development, developers use revision control systems for product management, mailing list systems for human communications, and bug tracking system...