Sciweavers

1952 search results - page 349 / 391
» Complete partitions of graphs
Sort
View
STACS
2010
Springer
15 years 11 months ago
The Complexity of Approximating Bounded-Degree Boolean #CSP
The degree of a CSP instance is the maximum number of times that a variable may appear in the scope of constraints. We consider the approximate counting problem for Boolean CSPs wi...
Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsen...
ATAL
2009
Springer
15 years 11 months ago
Solving multiagent assignment Markov decision processes
We consider the setting of multiple collaborative agents trying to complete a set of tasks as assigned by a centralized controller. We propose a scalable method called“Assignmen...
Scott Proper, Prasad Tadepalli
CSL
2009
Springer
15 years 11 months ago
Model Checking FO(R) over One-Counter Processes and beyond
Abstract. One-counter processes are pushdown processes over a singleton stack alphabet (plus a stack-bottom symbol). We study the problems of model checking asynchronous products o...
Anthony Widjaja To
CW
2008
IEEE
15 years 11 months ago
Keyframe Based Video Object Deformation
—This paper proposes a keyframe-based video object editing scheme for automatic object shape deformation. Except for object segmentation, several technologies are developed in th...
Yanlin Weng, Weiwei Xu, Shichao Hu, Jun Zhang, Bai...
HICSS
2008
IEEE
130views Biometrics» more  HICSS 2008»
15 years 11 months ago
Enterprise Modeling for Information System Development within MDA
Object-oriented analysis suggests semiformal usecase driven techniques for problem domain modeling from a computation independent viewpoint. The proposed approach called Topologic...
Janis Osis, Erika Asnina