Sciweavers

118 search results - page 20 / 24
» Complexity Cores and Hard Problem Instances
Sort
View
ICAC
2006
IEEE
14 years 1 months ago
The Laundromat Model for Autonomic Cluster Computing
Traditional High Performance Computing systems require extensive management and suffer from security and configuration problems. This paper presents a new clustermanagement syste...
Jacob Gorm Hansen, Eske Christiansen, Eric Jul
AAAI
2004
13 years 8 months ago
Combinatorial Auctions with Structured Item Graphs
Combinatorial auctions (CAs) are important mechanisms for allocating interrelated items. Unfortunately, winner determination is NP-complete unless there is special structure. We s...
Vincent Conitzer, Jonathan Derryberry, Tuomas Sand...
SIGECOM
2010
ACM
170views ECommerce» more  SIGECOM 2010»
14 years 5 days ago
Optimal online assignment with forecasts
Motivated by the allocation problem facing publishers in display advertising we formulate the online assignment with forecast problem, a version of the online allocation problem w...
Erik Vee, Sergei Vassilvitskii, Jayavel Shanmugasu...
EDBTW
2010
Springer
13 years 5 months ago
Using web-based personalization on spatial data warehouses
Spatial data warehouses (SDW) rely on extended multidimensional (MD) models in order to provide decision makers with appropriate structures to intuitively analyse spatial data. Se...
Octavio Glorio, Jose-Norberto Mazón, Irene ...
ECP
1997
Springer
128views Robotics» more  ECP 1997»
13 years 11 months ago
SINERGY: A Linear Planner Based on Genetic Programming
In this paper we describe SINERGY, which is a highly parallelizable, linear planning system that is based on the genetic programming paradigm. Rather than reasoning about the world...
Ion Muslea