Sciweavers

383 search results - page 55 / 77
» Common Subexpressions in Constraint Models of Planning Probl...
Sort
View
ICCAD
2001
IEEE
107views Hardware» more  ICCAD 2001»
14 years 4 months ago
A Convex Programming Approach to Positive Real Rational Approximation
As system integration evolves and tighter design constraints must be met, it becomes necessary to account for the non-ideal behavior of all the elements in a system. Certain devic...
Carlos P. Coelho, Joel R. Phillips, Luis Miguel Si...
MVA
2007
160views Computer Vision» more  MVA 2007»
13 years 9 months ago
Probabilistic Motion Segmentation of Videos for Temporal Super Resolution
A novel scheme is proposed for achieving motion segmentation in low-frame rate videos, with application to temporal super resolution. Probabilistic generative models are commonly ...
Arasanathan Thayananthan, Masahiro Iwasaki, Robert...
JAIR
2008
148views more  JAIR 2008»
13 years 7 months ago
Learning Partially Observable Deterministic Action Models
We present exact algorithms for identifying deterministic-actions' effects and preconditions in dynamic partially observable domains. They apply when one does not know the ac...
Eyal Amir, Allen Chang
APPROX
2006
Springer
124views Algorithms» more  APPROX 2006»
13 years 11 months ago
Combinatorial Algorithms for Data Migration to Minimize Average Completion Time
The data migration problem is to compute an efficient plan for moving data stored on devices in a network from one configuration to another. It is modeled by a transfer graph, wher...
Rajiv Gandhi, Julián Mestre
VAMOS
2010
Springer
13 years 9 months ago
Introducing TVL, a Text-based Feature Modelling
Feature models are a common way to represent variability in software product line engineering. For this purpose, most authors use a graphical notation based on FODA. The main drawb...
Quentin Boucher, Andreas Classen, Paul Faber, Patr...