Sciweavers

3267 search results - page 434 / 654
» Generalized quasirandom graphs
Sort
View
SODA
2010
ACM
214views Algorithms» more  SODA 2010»
16 years 4 months ago
A Fourier space algorithm for solving quadratic assignment problems
The quadratic assignment problem (QAP) is a central problem in combinatorial optimization. Several famous computationally hard tasks, such as graph matching, partitioning, and the...
Risi Kondor
STACS
2010
Springer
16 years 1 months ago
On Iterated Dominance, Matrix Elimination, and Matched Paths
We study computational problems that arise in the context of iterated dominance in anonymous games, and show that deciding whether a game can be solved by means of iterated weak d...
Felix Brandt, Felix A. Fischer, Markus Holzer
ICC
2009
IEEE
103views Communications» more  ICC 2009»
16 years 1 months ago
On the Minimum k-Connectivity Repair in Wireless Sensor Networks
—Repairing connectivity and achieving a certain level of fault tolerance are two important research challenges in wireless sensor networks that have, in many papers in the litera...
Hisham M. Almasaeid, Ahmed E. Kamal
TASE
2009
IEEE
16 years 1 months ago
Verifying Self-stabilizing Population Protocols with Coq
Population protocols are an elegant model recently introduced for distributed algorithms running in large and unreliable networks of tiny mobile agents. Correctness proofs of such...
Yuxin Deng, Jean-François Monin
153
Voted
ICTAI
2009
IEEE
16 years 1 months ago
Learning for Dynamic Assignments Reordering
In this paper a new learning scheme for SAT is proposed. The originality of our approach arises from its ability to achieve clause learning even if no conflict occurs. This clear...
Saïd Jabbour