Sciweavers

719 search results - page 46 / 144
» Adaptive Online Time Allocation to Search Algorithms
Sort
View
AAAI
2006
14 years 11 months ago
Memory Intensive Branch-and-Bound Search for Graphical Models
AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is its sens...
Radu Marinescu 0002, Rina Dechter
ALGORITHMICA
2000
161views more  ALGORITHMICA 2000»
14 years 9 months ago
Binary Searching with Nonuniform Costs and Its Application to Text Retrieval
We study the problem of minimizing the expected cost of binary searching for data where the access cost is not fixed and depends on the last accessed element, such as data stored i...
Gonzalo Navarro, Ricardo A. Baeza-Yates, Eduardo F...
WSDM
2012
ACM
301views Data Mining» more  WSDM 2012»
13 years 5 months ago
Learning evolving and emerging topics in social media: a dynamic nmf approach with temporal regularization
As massive repositories of real-time human commentary, social media platforms have arguably evolved far beyond passive facilitation of online social interactions. Rapid analysis o...
Ankan Saha, Vikas Sindhwani
WSC
2008
15 years 4 days ago
Simulation-based optimization for the quay crane scheduling problem
Maritime terminals of pure transhipment are emerging logistic realities in long-distance containerized trade. Here, complex activities of resource allocation and scheduling should...
Pasquale Legato, Rina Mary Mazza, Roberto Trunfio
IPPS
2000
IEEE
15 years 2 months ago
Replicating the Contents of a WWW Multimedia Repository to Minimize Download Time
Dynamic replication algorithms aim at allocating, migrating and deleting copies of an object over various Internet hosts, according to the access patterns exhibited online, so as ...
Thanasis Loukopoulos, Ishfaq Ahmad