Sciweavers

16188 search results - page 2562 / 3238
» The Optimal PAC Algorithm
Sort
View
198
Voted
SAC
2004
ACM
16 years 20 days ago
A cost-oriented approach for infrastructural design
The selection of a cost-minimizing combination of hardware and network components that satisfy organizational requirements is a complex design problem with multiple degrees of fre...
Danilo Ardagna, Chiara Francalanci, Marco Trubian
188
Voted
CP
2004
Springer
16 years 19 days ago
A Hybrid Method for Planning and Scheduling
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve planning and scheduling problems. Tasks are allocated to facilities using MILP and sche...
John N. Hooker
181
Voted
OOPSLA
2004
Springer
16 years 18 days ago
Finding your cronies: static analysis for dynamic object colocation
This paper introduces dynamic object colocation, an optimization to reduce copying costs in generational and other incremental garbage collectors by allocating connected objects t...
Samuel Z. Guyer, Kathryn S. McKinley
196
Voted
VLDB
2004
ACM
134views Database» more  VLDB 2004»
16 years 18 days ago
Model-Driven Data Acquisition in Sensor Networks
Declarative queries are proving to be an attractive paradigm for interacting with networks of wireless sensors. The metaphor that “the sensornet is a database” is problematic,...
Amol Deshpande, Carlos Guestrin, Samuel Madden, Jo...
HICSS
2003
IEEE
207views Biometrics» more  HICSS 2003»
16 years 16 days ago
Formalizing Multi-Agent POMDP's in the context of network routing
This paper uses partially observable Markov decision processes (POMDP’s) as a basic framework for MultiAgent planning. We distinguish three perspectives: first one is that of a...
Bharaneedharan Rathnasabapathy, Piotr J. Gmytrasie...
« Prev « First page 2562 / 3238 Last » Next »