Sciweavers

9719 search results - page 1586 / 1944
» Answer Set Optimization
Sort
View
WADS
2007
Springer
115views Algorithms» more  WADS 2007»
16 years 1 months ago
Priority Queues Resilient to Memory Faults
In the faulty-memory RAM model, the content of memory cells can get corrupted at any time during the execution of an algorithm, and a constant number of uncorruptible registers are...
Allan Grønlund Jørgensen, Gabriel Mo...
WADS
2007
Springer
155views Algorithms» more  WADS 2007»
16 years 1 months ago
Constant Factor Approximations for the Hotlink Assignment Problem
An approach for reducing the navigation effort for the users of a web site is to enhance its hyperlink structure with additional hotlinks. We address the task of adding at most on...
Tobias Jacobs
WAIM
2007
Springer
16 years 1 months ago
Building Data Synopses Within a Known Maximum Error Bound
The constructions of Haar wavelet synopses for large data sets have proven to be useful tools for data approximation. Recently, research on constructing wavelet synopses with a gua...
Chaoyi Pang, Qing Zhang, David P. Hansen, Anthony ...
WAOA
2007
Springer
126views Algorithms» more  WAOA 2007»
16 years 1 months ago
Better Bounds for Incremental Medians
In the incremental version of the well-known k-median problem the objective is to compute an incremental sequence of facility sets F1 ⊆ F2 ⊆ .... ⊆ Fn, where each Fk contain...
Marek Chrobak, Mathilde Hurand
WEBI
2007
Springer
16 years 1 months ago
Improving Performance of Web Services Query Matchmaking with Automated Knowledge Acquisition
There is a critical need to design and develop tools tract away the fundamental complexity of XML-based Web services specifications and toolkits, and provide an elegant, intuitive...
Chaitali Gupta, Rajdeep Bhowmik, Michael R. Head, ...
« Prev « First page 1586 / 1944 Last » Next »