Sciweavers

1095 search results - page 99 / 219
» Preprocessing of Intractable Problems
Sort
View
AAAI
2006
13 years 11 months ago
The Complexity of Bribery in Elections
We study the complexity of influencing elections through bribery: How computationally complex is it for an external actor to determine whether by a certain amount of bribing voter...
Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hem...
IPCO
1992
112views Optimization» more  IPCO 1992»
13 years 11 months ago
The Metric Polytope
In this paper we study enumeration problems for polytopes arising from combinatorial optimization problems. While these polytopes turn out to be quickly intractable for enumeration...
Monique Laurent, Svatopluk Poljak
ECAI
2010
Springer
13 years 11 months ago
EP for Efficient Stochastic Control with Obstacles
Abstract. We address the problem of continuous stochastic optimal control in the presence of hard obstacles. Due to the non-smooth character of the obstacles, the traditional appro...
Thomas Mensink, Jakob J. Verbeek, Bert Kappen
ICML
2010
IEEE
13 years 11 months ago
Gaussian Processes Multiple Instance Learning
This paper proposes a multiple instance learning (MIL) algorithm for Gaussian processes (GP). The GP-MIL model inherits two crucial benefits from GP: (i) a principle manner of lea...
Minyoung Kim, Fernando De la Torre
CCR
2008
88views more  CCR 2008»
13 years 10 months ago
Rethinking virtual network embedding: substrate support for path splitting and migration
Network virtualization is a powerful way to run multiple architectures or experiments simultaneously on a shared infrastructure. However, making efficient use of the underlying re...
Minlan Yu, Yung Yi, Jennifer Rexford, Mung Chiang