3204 search results - page 451 / 641 » The Alcuin Number of a Graph |
170
click to vote
WADS
1993
Springer
15 years 11 months ago
1993
Springer
Our work is based on the pioneering work in sphere separators done by Miller, Teng, Vavasis et al, [8, 12], who gave efficient static (fixed input) algorithms for finding sphere ...
196
click to vote
CDC
2009
IEEE
15 years 11 months ago
2009
IEEE
Distributed decision making in networked systems depends critically on the timely availability of critical fresh information. Performance of networked systems, from the perspective...
153
click to vote
ECP
1997
Springer
15 years 11 months ago
1997
Springer
During the planning process, a planner may have many options for refinements to perform on the plan being developed. The planner’s efficiency depends on how it chooses which ref...
171
click to vote
ICALP
1992
Springer
15 years 11 months ago
1992
Springer
Suppose that n tokens are arbitrarily placed on the n nodes of a graph. At each parallel step one token may be moved from each node to an adjacent node. An algorithm for the near-...
219
click to vote
RIVF
2003
15 years 8 months ago
2003
—In this paper we consider the Airspace Sectorization Problem (ASP) where airspace has to be partitioned into a number of sectors, each sector being assigned to a team of air tra...