Sciweavers

10608 search results - page 711 / 2122
» Complexity of O'Hara's Algorithm
Sort
View
CP
2003
Springer
16 years 20 days ago
A Synthesis of Constraint Satisfaction and Constraint Solving
Abstract. This paper offers a critique of the framework of Constraint Satisfaction Problems. While this framework has been successful in studying search techniques, and has inspire...
Michael J. Maher
FOCS
2002
IEEE
16 years 12 days ago
The Partition Technique for Overlays of Envelopes
We obtain a near-tight bound of O(n3+ε ), for any ε > 0, on the complexity of the overlay of the minimization diagrams of two collections of surfaces in four dimensions. This...
Vladlen Koltun, Micha Sharir
ATAL
2010
Springer
15 years 8 months ago
Manipulation of copeland elections
We resolve an open problem regarding the complexity of unweighted coalitional manipulation, namely, the complexity of Copeland -manipulation for {0, 1}. Copeland , 0 1, is an...
Piotr Faliszewski, Edith Hemaspaandra, Henning Sch...
ATAL
2010
Springer
15 years 8 months ago
How important are updating schemes in multi-agent systems? An illustration on a multi-turmite model
It is to date an open question to know how the updating methods affect the evolution of a multi-agent system. This question has been tackled for various complex systems such as ce...
Nazim Fatès, Vincent Chevrier
ICASSP
2010
IEEE
15 years 7 months ago
A convex relaxation for approximate maximum-likelihood 2D source localization from range measurements
This paper addresses the problem of locating a single source from noisy range measurements in wireless sensor networks. An approximate solution to the maximum likelihood location ...
Pinar Oguz-Ekim, João Pedro Gomes, Jo&atild...