Sciweavers

216 search results - page 36 / 44
» The Complexity of Planning Problems With Simple Causal Graph...
Sort
View
AAAI
2000
13 years 9 months ago
What Sensing Tells Us: Towards a Formal Theory of Testing for Dynamical Systems
Just as actions can have indirect effects on the state of the world, so too can sensing actions have indirect effects on an agent's state of knowledge. In this paper, we inve...
Sheila A. McIlraith, Richard B. Scherl
TCAD
2008
106views more  TCAD 2008»
13 years 7 months ago
Track Routing and Optimization for Yield
Abstract--In this paper, we propose track routing and optimization for yield (TROY), the first track router for the optimization of yield loss due to random defects. As the probabi...
Minsik Cho, Hua Xiang, Ruchir Puri, David Z. Pan
FLAIRS
2004
13 years 9 months ago
A New Approach for Heterogeneous Hybridization of Constraint Satisfaction Search Algorithms
In the recent years, CSP's have come to be seen as the core problem in many applications. We propose here a hybrid algorithm (MC-FC) that combines two different search method...
Debasis Mitra, Hyoung-rae Kim
COMGEO
2006
ACM
13 years 7 months ago
Computing homotopic shortest paths efficiently
Geometric shortest paths are a major topic in computational geometry; see the survey paper by Mitchell [12]. A shortest path between two points in a simple polygon can be found in...
Alon Efrat, Stephen G. Kobourov, Anna Lubiw
SPAA
2005
ACM
14 years 1 months ago
Oblivious routing on geometric networks
We study oblivious routing in which the packet paths are constructed independently of each other. We give a simple oblivious routing algorithm for geometric networks in which the ...
Costas Busch, Malik Magdon-Ismail, Jing Xi