Sciweavers

1346 search results - page 35 / 270
» Algorithmic Search for Flexibility Using Resultants of Polyn...
Sort
View
AGENTS
1999
Springer
13 years 12 months ago
Top-Down Search for Coordinating the Hierarchical Plans of Multiple Agents
Uncertain and complex environments demand that an agent be able to anticipate the actions of others in order to avoid resource conflicts with them and to realize its goals. Confli...
Bradley J. Clement, Edmund H. Durfee
GECCO
2008
Springer
129views Optimization» more  GECCO 2008»
13 years 8 months ago
Searching for liveness property violations in concurrent systems with ACO
Liveness properties in concurrent systems are, informally, those properties that stipulate that something good eventually happens during execution. In order to prove that a given ...
Enrique Alba, J. Francisco Chicano
BMCBI
2010
113views more  BMCBI 2010»
13 years 7 months ago
Efficient protein alignment algorithm for protein search
Background: Proteins show a great variety of 3D conformations, which can be used to infer their evolutionary relationship and to classify them into more general groups; therefore ...
Zaixin Lu, Zhiyu Zhao, Bin Fu
3DIM
2007
IEEE
14 years 2 months ago
Cached k-d tree search for ICP algorithms
The ICP (Iterative Closest Point) algorithm is the de facto standard for geometric alignment of threedimensional models when an initial relative pose estimate is available. The ba...
Andreas Nüchter, Kai Lingemann, Joachim Hertz...
STOC
2002
ACM
118views Algorithms» more  STOC 2002»
14 years 8 months ago
On the advantage over a random assignment
: We initiate the study of a new measure of approximation. This measure compares the performance of an approximation algorithm to the random assignment algorithm. This is a useful ...
Johan Håstad, Srinivasan Venkatesh