2412 search results - page 39 / 483 » Which Problems Have Strongly Exponential Complexity |
ICML
2008
IEEE
14 years 10 months ago
2008
IEEE
Multi-view learning has become a hot topic during the past few years. In this paper, we first characterize the sample complexity of multi-view active learning. Under the expansion...
CBSE
2004
Springer
14 years 3 months ago
2004
Springer
: In distributed and mobile environments, the connections among the hosts on which a software system is running are often unstable. As a result of connectivity losses, the overall ...
EOR
2008
13 years 10 months ago
2008
The 0-1 Multidimensional Knapsack Problem (0-1 MKP) is a wellknown (and strongly NP-hard) combinatorial optimization problem with many applications. Up to now, the majority of upp...
ATAL
2009
Springer
14 years 4 months ago
2009
Springer
In hedonic games, players have the opportunity to form coalitions, and have preferences over the coalitions they might join. Such games can be used to model a variety of settings ...
WADS
2001
Springer
14 years 2 months ago
2001
Springer
This paper investigates the problem of time-optimum movement planning in two and three dimensions for a point robot which has bounded control velocity through a set of n polygonal...