1197 search results - page 130 / 240 » Which Dynamic Constraint Problems Can Be Solved By Ants |
KES
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. This research develops an optimal planning model for pump-treatinject based groundwater remediation systems. Optimizing the design of the pump-treat-inject system is a no...
CORR
2007
Springer
13 years 8 months ago
2007
Springer
Abstract— We develop a general framework for MAP estimation in discrete and Gaussian graphical models using Lagrangian relaxation techniques. The key idea is to reformulate an in...
CIKM
2011
Springer
12 years 8 months ago
2011
Springer
In this paper, we reveal a common deficiency of the current retrieval models: the component of term frequency (TF) normalization by document length is not lower-bounded properly;...
ICDE
2009
IEEE
14 years 3 months ago
2009
IEEE
— In this paper, we will study the problem of projected clustering of uncertain data streams. The use of uncertainty is especially important in the high dimensional scenario, bec...
INFOCOM
2005
IEEE
14 years 1 months ago
2005
IEEE
Abstract— We consider the problem of power controlled minimum frame length scheduling for TDMA wireless networks. Given a set of one-hop transmission requests, our objective is t...