Sciweavers

2657 search results - page 273 / 532
» On the complexity of hierarchical problem solving
Sort
View
ACID
2006
236views Algorithms» more  ACID 2006»
15 years 8 months ago
Kernelization for Convex Recoloring
The Convex Recoloring (CR) problem measures how far a tree of characters differs from exhibiting a so-called "perfect phylogeny". For input consisting of a vertex-colored...
Hans L. Bodlaender, Michael R. Fellows, Michael A....
ICAI
2003
15 years 8 months ago
Threshold Behavior in a Boolean Network Model for SAT
Boolean satisfiability (SAT) is the canonical NP-complete problem that plays an important role in AI and has many practical applications in Computer Science in general. Boolean n...
Alejandro Bugacov, Aram Galstyan, Kristina Lerman
SIGMETRICS
2010
ACM
181views Hardware» more  SIGMETRICS 2010»
15 years 7 months ago
A unified modeling framework for distributed resource allocation of general fork and join processing networks
This paper addresses the problem of distributed resource allocation in general fork and join processing networks. The problem is motivated by the complicated processing requiremen...
Haiquan (Chuck) Zhao, Cathy H. Xia, Zhen Liu, Dona...
CORR
2010
Springer
69views Education» more  CORR 2010»
15 years 6 months ago
Efficient Knowledge Base Management in DCSP
DCSP (Distributed Constraint Satisfaction Problem) has been a very important research area in AI (Artificial Intelligence). There are many application problems in distributed AI t...
Hong Jiang
IJON
2008
158views more  IJON 2008»
15 years 6 months ago
Blind separation of convolutive image mixtures
Convolutive mixtures of images are common in photography of semi-reflections. They also occur in microscopy and tomography. Their formation process involves focusing on an object ...
Sarit Shwartz, Yoav Y. Schechner, Michael Zibulevs...