Sciweavers

2834 search results - page 145 / 567
» Representing Trees with Constraints
Sort
View
TVLSI
2010
13 years 5 months ago
Discrete Buffer and Wire Sizing for Link-Based Non-Tree Clock Networks
Clock network is a vulnerable victim of variations as well as a main power consumer in many integrated circuits. Recently, link-based non-tree clock network attracts people's...
Rupak Samanta, Jiang Hu, Peng Li
JIRS
2010
104views more  JIRS 2010»
13 years 8 months ago
On the Generation of Trajectories for Multiple UAVs in Environments with Obstacles
Abstract This paper presents a methodology based on a variation of the Rapidlyexploring Random Trees (RRTs) that generates feasible trajectories for a team of autonomous aerial veh...
Armando Alves Neto, Douglas Guimarães Macha...
CSCLP
2008
Springer
14 years 5 days ago
Solving CSPs with Naming Games
Abstract. Constraint solving problems (CSPs) represent a formalization of an important class of problems in computer science. We propose here a solving methodology based on the nam...
Stefano Bistarelli, Giorgio Gosti
CPAIOR
2007
Springer
14 years 4 months ago
A Position-Based Propagator for the Open-Shop Problem
The Open-Shop Problem is a hard problem that can be solved using Constraint Programming or Operation Research methods. Existing techniques are efficient at reducing the search tree...
Jean-Noël Monette, Yves Deville, Pierre Dupon...
TALG
2011
98views more  TALG 2011»
13 years 5 months ago
Tree exploration with logarithmic memory
We consider the task of network exploration by a mobile agent (robot) with small memory. The agent has to traverse all nodes and edges of a network (represented as an undirected c...
Christoph Ambühl, Leszek Gasieniec, Andrzej P...