Sciweavers

4345 search results - page 744 / 869
» Temporal Constraint Networks
Sort
View
AI
2005
Springer
13 years 7 months ago
Asynchronous backtracking without adding links: a new member in the ABT family
Following the pioneer work of Yokoo and colleagues on the ABT (asynchronous backtracking) algorithm, several ABT-based procedures have been proposed for solving distributed constr...
Christian Bessière, Arnold Maestre, Ismel B...
TOG
2008
100views more  TOG 2008»
13 years 7 months ago
Interactive procedural street modeling
This paper addresses the problem of interactively modeling large street networks. We introduce a modeling framework that uses tensor fields to guide the generation of a street gra...
Guoning Chen, Gregory Esch, Peter Wonka, Pascal M&...
TVLSI
2008
106views more  TVLSI 2008»
13 years 7 months ago
Efficient Distributed On-Chip Decoupling Capacitors for Nanoscale ICs
Abstract--A distributed on-chip decoupling capacitor network is proposed in this paper. A system of distributed on-chip decoupling capacitors is shown to provide an efficient solut...
Mikhail Popovich, Eby G. Friedman, Radu M. Secarea...
JAIR
2002
120views more  JAIR 2002»
13 years 7 months ago
Learning Geometrically-Constrained Hidden Markov Models for Robot Navigation: Bridging the Topological-Geometrical Gap
Hidden Markov models hmms and partially observable Markov decision processes pomdps provide useful tools for modeling dynamical systems. They are particularly useful for represent...
Hagit Shatkay, Leslie Pack Kaelbling
OR
2007
Springer
13 years 7 months ago
Hybrid heuristics for the probabilistic maximal covering location-allocation problem
The Maximal Covering Location Problem (MCLP) maximizes the population that has a facility within a maximum travel distance or time. Numerous extensions have been proposed to enhan...
Francisco de Assis Corrêa, Antonio Augusto C...