Sciweavers

2398 search results - page 386 / 480
» Constraint Programming and Graph Algorithms
Sort
View
143
Voted
JAIR
2006
179views more  JAIR 2006»
15 years 2 months ago
The Fast Downward Planning System
Fast Downward is a classical planning system based on heuristic search. It can deal with general deterministic planning problems encoded in the propositional fragment of PDDL2.2, ...
Malte Helmert
ISPD
2009
ACM
141views Hardware» more  ISPD 2009»
15 years 9 months ago
A faster approximation scheme for timing driven minimum cost layer assignment
As VLSI technology moves to the 65nm node and beyond, interconnect delay greatly limits the circuit performance. As a critical component in interconnect synthesis, layer assignmen...
Shiyan Hu, Zhuo Li, Charles J. Alpert
131
Voted
CORR
2008
Springer
150views Education» more  CORR 2008»
15 years 2 months ago
Message-passing for Maximum Weight Independent Set
Abstract--In this paper, we investigate the use of messagepassing algorithms for the problem of finding the max-weight independent set (MWIS) in a graph. First, we study the perfor...
Sujay Sanghavi, Devavrat Shah, Alan S. Willsky
104
Voted
PERCOM
2006
ACM
16 years 2 months ago
Avoiding privacy violations caused by context-sensitive services
The increasing availability of information about people's context makes it possible to deploy context-sensitive services, where access to resources provided or managed by a s...
Urs Hengartner, Peter Steenkiste
127
Voted
CVPR
2007
IEEE
15 years 9 months ago
Single View Human Action Recognition using Key Pose Matching and Viterbi Path Searching
3D human pose recovery is considered as a fundamental step in view-invariant human action recognition. However, inferring 3D poses from a single view usually is slow due to the la...
Fengjun Lv, Ramakant Nevatia