1101 search results - page 131 / 221 » An Algorithm for the Graph Crossing Number Problem |
131
click to vote
TACAS
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. The analysis of message sequence charts (MSCs) is highly important in preventing common problems in communication protocols. Detecting race conditions, i.e., possible dis...
152
click to vote
EMMCVPR
2007
Springer
15 years 11 months ago
2007
Springer
Classic mosaic is one of the oldest and most durable art forms. There has been a growing interest in simulating classic mosaics from digital images recently. To be visually pleasin...
115
click to vote
INFOCOM
2009
IEEE
15 years 11 months ago
2009
IEEE
—We study the distributed desynchronization problem for graphs with arbitrary topology. Motivated by the severe computational limitations of sensor networks, we present a randomi...
166
Voted
KR
2004
Springer
15 years 10 months ago
2004
Springer
One of the major advances in classical planning has been the development of Graphplan. Graphplan builds a layered structure called the planning graph, and then searches this struc...
180
Voted
PACT
2005
Springer
15 years 10 months ago
2005
Springer
The goal of our investigation is to find automatically the best rule for a cell in the cellular automata model. The cells are either of type Obstacle, Empty or Creature. Only Crea...