Sciweavers

13987 search results - page 360 / 2798
» The Two Guards Problem
Sort
View
183
Voted
SIAMSC
2008
139views more  SIAMSC 2008»
15 years 6 months ago
Probing the Pareto Frontier for Basis Pursuit Solutions
The basis pursuit problem seeks a minimum one-norm solution of an underdetermined least-squares problem. Basis pursuit denoise (BPDN) fits the least-squares problem only approximat...
Ewout van den Berg, Michael P. Friedlander
AAMAS
2000
Springer
15 years 6 months ago
Algorithms for Distributed Constraint Satisfaction: A Review
When multiple agents are in a shared environment, there usually exist constraints among the possible actions of these agents. A distributed constraint satisfaction problem (distrib...
Makoto Yokoo, Katsutoshi Hirayama
154
Voted
ISMIS
2003
Springer
15 years 12 months ago
Comparing Simplification Methods for Model Trees with Regression and Splitting Nodes
In this paper we tackle the problem of simplifying tree-based regression models, called model trees, which are characterized by two types of internal nodes, namely regression nodes...
Michelangelo Ceci, Annalisa Appice, Donato Malerba
RANDOM
2001
Springer
15 years 11 months ago
On the Equivalence between the Primal-Dual Schema and the Local-Ratio Technique
We discuss two approximation approaches, the primal-dual schema and the local-ratio technique. We present two relatively simple frameworks, one for each approach, which extend know...
Reuven Bar-Yehuda, Dror Rawitz
SPIRE
2001
Springer
15 years 11 months ago
Speeding-up Hirschberg and Hunt-Szymanski LCS Algorithms
Two algorithms are presented that solve the problem of recovering the longest common subsequence of two strings. The £rst algorithm is an improvement of Hirschberg’s divide-andc...
Maxime Crochemore, Costas S. Iliopoulos, Yoan J. P...