Sciweavers

1454 search results - page 81 / 291
» Learning with cost intervals
Sort
View
CCGRID
2008
IEEE
15 years 12 months ago
Scalable Data Gathering for Real-Time Monitoring Systems on Distributed Computing
Real-time monitoring is increasingly becoming important in various scenes of large scale, multi-site distributed/parallel computing, e.g, understanding behavior of systems, schedu...
Yoshikazu Kamoshida, Kenjiro Taura
SPIRE
2005
Springer
15 years 11 months ago
Rank-Sensitive Data Structures
Output-sensitive data structures result from preprocessing n items and are capable of reporting the items satisfying an on-line query in O(t(n) + ℓ) time, where t(n) is the cost ...
Iwona Bialynicka-Birula, Roberto Grossi
CEC
2005
IEEE
15 years 7 months ago
Multi-objective optimisation of the pump scheduling problem using SPEA2
Abstract- Significant operational cost and energy savings can be achieved by optimising the schedules of pumps, which pump water from source reservoirs to storage tanks, in Water ...
Manuel López-Ibáñez, T. Devi ...
EOR
2007
80views more  EOR 2007»
15 years 5 months ago
A partition approach to the inventory/routing problem
In this study we focus on the integration of inventory control and vehicle routing schedules for a distribution system in which the warehouse is responsible for the replenishment ...
Qiu-Hong Zhao, Shouyang Wang, Kin Keung Lai
VLDB
2002
ACM
188views Database» more  VLDB 2002»
15 years 5 months ago
Continuous Nearest Neighbor Search
A continuous nearest neighbor query retrieves the nearest neighbor (NN) of every point on a line segment (e.g., "find all my nearest gas stations during my route from point s...
Yufei Tao, Dimitris Papadias, Qiongmao Shen