Sciweavers

373 search results - page 54 / 75
» An ACO Algorithm for the Most Probable Explanation Problem
Sort
View
INFOCOM
2010
IEEE
13 years 6 months ago
Optimal Linear Network Coding Design for Secure Unicast with Multiple Streams
—Linear network coding is a promising technology that can maximize the throughput capacity of communication network. Despite this salient feature, there are still many challenges...
Jin Wang, Jianping Wang, Kejie Lu, Bin Xiao, Naiji...
AIPS
2000
13 years 9 months ago
Planning with Incomplete Information as Heuristic Search in Belief Space
The formulation of planning as heuristic search with heuristics derived from problem representations has turned out to be a fruitful approach for classical planning. In this paper...
Blai Bonet, Hector Geffner
APIN
2004
127views more  APIN 2004»
13 years 7 months ago
CLSS: An Intelligent Crane Lorry Scheduling System
Companies that provide crane-lorry services are faced with the daily need to perform vehicle and driver allocation and scheduling. Many companies still do this manually due to the ...
Hon Wai Chun, Rebecca Y. M. Wong
ICDE
2006
IEEE
163views Database» more  ICDE 2006»
14 years 9 months ago
A Sampling-Based Approach to Optimizing Top-k Queries in Sensor Networks
Wireless sensor networks generate a vast amount of data. This data, however, must be sparingly extracted to conserve energy, usually the most precious resource in battery-powered ...
Adam Silberstein, Carla Schlatter Ellis, Jun Yang ...
ICML
2008
IEEE
14 years 8 months ago
Fast incremental proximity search in large graphs
In this paper we investigate two aspects of ranking problems on large graphs. First, we augment the deterministic pruning algorithm in Sarkar and Moore (2007) with sampling techni...
Purnamrita Sarkar, Andrew W. Moore, Amit Prakash