Sciweavers

2487 search results - page 421 / 498
» Partitions of Graphs into Trees
Sort
View
CORR
2007
Springer
147views Education» more  CORR 2007»
13 years 8 months ago
Decomposition During Search for Propagation-Based Constraint Solvers
Abstract. We describe decomposition during search (DDS), an integration of And/Or tree search into propagation-based constraint solvers. The presented search algorithm dynamically ...
Martin Mann, Guido Tack, Sebastian Will
JDA
2007
97views more  JDA 2007»
13 years 8 months ago
Local solutions for global problems in wireless networks
In this paper, we review a recently developed class of algorithms that solve global problems in unit distance wireless networks by means of local algorithms. A local algorithm is ...
Jorge Urrutia
TROB
2008
112views more  TROB 2008»
13 years 8 months ago
A Complete and Scalable Strategy for Coordinating Multiple Robots Within Roadmaps
Abstract--This paper addresses the challenging problem of finding collision-free trajectories for many robots moving toward individual goals within a common environment. Most popul...
Mike Peasgood, Christopher M. Clark, John McPhee
TVLSI
2008
116views more  TVLSI 2008»
13 years 8 months ago
Fast Substrate Noise Aware Floorplanning for Mixed Signal SOC Designs
Abstract--In this paper, we introduce a novel substrate noise estimation technique during early floorplanning for mixed signal system-on-chip (SOC), based on block preference direc...
Minsik Cho, David Z. Pan
ALGORITHMICA
2002
101views more  ALGORITHMICA 2002»
13 years 8 months ago
Improved Algorithms for Constructing Fault-Tolerant Spanners
Let S be a set of n points in a metric space, and k a positive integer. Algorithms are given that construct k-fault-tolerant spanners for S. If in such a spanner at most k vertice...
Christos Levcopoulos, Giri Narasimhan, Michiel H. ...