Sciweavers

4526 search results - page 363 / 906
» Algorithmic problems related to the Internet
Sort
View
AAIM
2009
Springer
143views Algorithms» more  AAIM 2009»
15 years 4 months ago
Discrete online TSP
In this paper we introduce a discrete version of the online traveling salesman problem (DOLTSP). We represent the metric space using a weighted graph, where the server is allowed t...
Mauro Aprea, Esteban Feuerstein, Gustavo Sadovoy, ...
WWW
2011
ACM
15 years 1 months ago
Consideration set generation in commerce search
In commerce search, the set of products returned by a search engine often forms the basis for all user interactions leading up to a potential transaction on the web. Such a set of...
Sayan Bhattacharya, Sreenivas Gollapudi, Kamesh Mu...
DAC
2005
ACM
16 years 7 months ago
Multi-threaded reachability
Partitioned BDD-based algorithms have been proposed in the literature to solve the memory explosion problem in BDD-based verification. Such algorithms can be at times ineffective ...
Debashis Sahoo, Jawahar Jain, Subramanian K. Iyer,...
ICRA
2007
IEEE
131views Robotics» more  ICRA 2007»
16 years 1 months ago
Simulation Issues in Haptics
Abstract— In this paper, two problems related to the simulation of virtual environments for haptic systems are considered. The first problem is how to simulate, in discrete time...
Gianni Borghesan, Alessandro Macchelli, Claudio Me...
JCO
2008
66views more  JCO 2008»
15 years 6 months ago
The hierarchical model for load balancing on two machines
Following previous work, we consider the hierarchical load balancing model on two machines of possibly different speeds. We first focus on maximizing the minimum machine load and ...
Orion Chassid, Leah Epstein