Sciweavers

13987 search results - page 668 / 2798
» The Two Guards Problem
Sort
View
CPM
2010
Springer
120views Combinatorics» more  CPM 2010»
16 years 9 days ago
Mod/Resc Parsimony Inference
Abstract. We address in this paper a new computational biology problem that aims at understanding a mechanism that could potentially be used to genetically manipulate natural insec...
Igor Nor, Danny Hermelin, Sylvain Charlat, Jan Eng...
ISAAC
2009
Springer
87views Algorithms» more  ISAAC 2009»
16 years 2 days ago
Parameterizing Cut Sets in a Graph by the Number of Their Components
For a connected graph G = (V, E), a subset U ⊆ V is called a k-cut if U disconnects G, and the subgraph induced by U contains exactly k (≥ 1) components. More specifically, a ...
Takehiro Ito, Marcin Kaminski, Daniël Paulusm...
CP
2001
Springer
15 years 12 months ago
A Dynamic Distributed Constraint Satisfaction Approach to Resource Allocation
Abstract. In distributed resource allocation a set of agents must assign their resources to a set of tasks. This problem arises in many real-world domains such as disaster rescue, ...
Pragnesh Jay Modi, Hyuckchul Jung, Milind Tambe, W...
ICDT
2001
ACM
110views Database» more  ICDT 2001»
15 years 12 months ago
On Answering Queries in the Presence of Limited Access Patterns
In information-integration systems, source relations often have limitations on access patterns to their data; i.e., when one must provide values for certain attributes of a relatio...
Chen Li, Edward Y. Chang
ICCV
1999
IEEE
15 years 11 months ago
Learning Low-Level Vision
We describe a learning-based method for low-level vision problems--estimating scenes from images. We generate a synthetic world of scenes and their corresponding rendered images, m...
William T. Freeman, Egon C. Pasztor