Sciweavers

413 search results - page 4 / 83
» Computing and Exploiting Tree-Decompositions for Solving Con...
Sort
View
65
Voted
ICTAI
2007
IEEE
15 years 3 months ago
Hypergraph Partitioning for Exploiting Localities in Nonlinear Constrained Optimization
In this paper, we present a new hypergraph partitioning algorithm that jointly optimizes the number of hyperedge cuts and the number of shared vertices in nonlinear constrained op...
Benjamin W. Wah, Soomin Lee
APLAS
2000
ACM
15 years 1 months ago
An Open Environment for Cooperative Equational Solving
We describe a system called CFLP which aims at the integration of the best features of functional logic programming (FLP), cooperative constraint solving (CCS), and distributed co...
Tetsuo Ida, Mircea Marin
CONSTRAINTS
2010
110views more  CONSTRAINTS 2010»
14 years 7 months ago
Solving subgraph isomorphism problems with constraint programming
The subgraph isomorphism problem consists in deciding if there exists a copy of a pattern graph in a target graph. We introduce in this paper a global constraint and an associated ...
Stéphane Zampelli, Yves Deville, Christine ...
75
Voted
NETWORKS
2008
14 years 9 months ago
Reformulation and sampling to solve a stochastic network interdiction problem
The Network Interdiction Problem involves interrupting an adversary's ability to maximize flow through a capacitated network by destroying portions of the network. A budget c...
Udom Janjarassuk, Jeff Linderoth
CEEMAS
2005
Springer
15 years 3 months ago
On Communication in Solving Distributed Constraint Satisfaction Problems
Abstract. Distributed Constraint Satisfaction Problems (DCSP) is a general framework for multi-agent coordination and conflict resolution. In most DCSP algorithms, inter-agent com...
Hyuckchul Jung, Milind Tambe