Sciweavers

19130 search results - page 166 / 3826
» Modelling multi-path problems
Sort
View
SIAMCOMP
2008
167views more  SIAMCOMP 2008»
15 years 6 months ago
Approximation Algorithms for Data Placement Problems
We develop approximation algorithms for the problem of placing replicated data in arbitrary networks, where the nodes may both issue requests for data objects and have capacity fo...
Ivan D. Baev, Rajmohan Rajaraman, Chaitanya Swamy
HT
1987
ACM
15 years 10 months ago
Exploring Representation Problems Using Hypertext
Hypertext is a technology well-suited to exploring different kinds of representational problems. It can be used first as an informal mechanism to describe the attributes of object...
Catherine C. Marshall
STOC
2003
ACM
152views Algorithms» more  STOC 2003»
16 years 6 months ago
Cell-probe lower bounds for the partial match problem
Given a database of n points in {0, 1}d, the partial match problem is: In response to a query x in {0, 1, }d, find a database point y such that for every i whenever xi = , we have...
T. S. Jayram, Subhash Khot, Ravi Kumar, Yuval Raba...
CPAIOR
2008
Springer
15 years 8 months ago
The Accuracy of Search Heuristics: An Empirical Study on Knapsack Problems
Theoretical models for the evaluation of quickly improving search strategies, like limited discrepancy search, are based on specific assumptions regarding the probability that a va...
Daniel H. Leventhal, Meinolf Sellmann
TOMS
1998
148views more  TOMS 1998»
15 years 6 months ago
PELLPACK: A Problem-Solving Environment for PDE-Based Applications on Multicomputer Platforms
This paper presents the software architecture and implementation of the problem solving environment (PSE) PELLPACK for modeling physical objects described by partial differential ...
Elias N. Houstis, John R. Rice, Sanjiva Weerawaran...