Sciweavers

881 search results - page 112 / 177
» Solving satisfiability problems with preferences
Sort
View
EUROPAR
1999
Springer
13 years 12 months ago
A New Algorithm for Multi-objective Graph Partitioning
Recently, a number of graph partitioning applications have emerged with additional requirements that the traditional graph partitioning model alone cannot e ectively handle. One s...
Kirk Schloegel, George Karypis, Vipin Kumar
CATS
2007
13 years 9 months ago
On The Complexity of Manipulating Elections
We study the manipulation of voting schemes, where a voter lies about their preferences in the hope of improving the election’s outcome. All voting schemes are potentially manip...
Tom Coleman, Vanessa Teague
UAI
1990
13 years 8 months ago
Ideal reformulation of belief networks
The intelligent reformulation or restructuring of a belief network can greatly increase the efficiency of inference. However, time expended for reformulation is not available for ...
Jack S. Breese, Eric Horvitz
TON
2002
99views more  TON 2002»
13 years 7 months ago
Computing shortest paths for any number of hops
In this paper we introduce and investigate a new" path optimization problem which we denote as the All Hops Optimal Path AHOP problem. The problem involves identifying, for a...
Roch Guérin, Ariel Orda
TACAS
2010
Springer
145views Algorithms» more  TACAS 2010»
14 years 2 months ago
Rational Synthesis
Abstract. Synthesis is the automated construction of a system from its specification. The system has to satisfy its specification in all possible environments. Modern systems oft...
Dana Fisman, Orna Kupferman, Yoad Lustig