13376 search results - page 277 / 2676 » Problem Solving with |
118
click to vote
ICCSA
2010
Springer
15 years 5 months ago
2010
Springer
This paper achieves O(n3 log log n/ log n) time for the 2center problems on a directed graph with non-negative edge costs under the conventional RAM model where only arithmetic ope...
126
click to vote
IAT
2006
IEEE
15 years 10 months ago
2006
IEEE
In this paper we present a formalism for symbolic negotiation. We regard symbolic negotiation as cooperative problem solving (CPS), which is based on symbolic reasoning and is ext...
108
click to vote
COCOON
2006
Springer
15 years 7 months ago
2006
Springer
We consider the problem of placing a set of disks in a region containing obstacles such that no two disks intersect. We are given a bounding polygon P and a set R of possibly inte...
144
Voted
EMMCVPR
2011
Springer
14 years 3 months ago
2011
Springer
Variational relaxations can be used to compute approximate minimizers of optimal partitioning and multiclass labeling problems on continuous domains. While the resulting relaxed co...
136
click to vote
EVOW
2001
Springer
15 years 8 months ago
2001
Springer
This work introduces a highly constrained school timetabling problem which was modeled from the requirements of a German high school. The concept for solving the problem uses a hyb...