4860 search results - page 596 / 972 » SNPs Problems, Complexity, and Algorithms |
172
click to vote
ISCAPDCS
2003
15 years 6 months ago
2003
The quick construction of the Shortest Path Tree (SPT) is essential to achieve fast routing speed for an interior network using link state protocols, such as OSPF and IS-IS. Whene...
132
Voted
WSCG
2004
15 years 6 months ago
2004
Collision detection between moving objects is an open question which raises major problems concerning its algorithmic complexity. In this paper we present a polygon collision dete...
147
click to vote
GECCO
2008
Springer
15 years 6 months ago
2008
Springer
This paper presents a path planner for Unmanned Air Vehicles (UAVs) based on Evolutionary Algorithms (EA) that can be used in realistic risky scenarios. The path returned by the a...
148
click to vote
AAMAS
2010
Springer
15 years 5 months ago
2010
Springer
POMDPs and their decentralized multiagent counterparts, DEC-POMDPs, offer a rich framework for sequential decision making under uncertainty. Their computational complexity, howeve...
123
click to vote
VLSI
2010
Springer
15 years 3 months ago
2010
Springer
—Multi-Vdd techniques enable application of lower supply voltage levels on cells with timing slacks. New voltage assignment, placement and voltage island partitioning methods are...