Sciweavers

6582 search results - page 143 / 1317
» The focus of attention problem
Sort
View
STOC
2006
ACM
125views Algorithms» more  STOC 2006»
16 years 6 months ago
On earthmover distance, metric labeling, and 0-extension
We study the fundamental classification problems 0-Extension and Metric Labeling. A generalization of Multiway Cut, 0-Extension is closely related to partitioning problems in grap...
Howard J. Karloff, Subhash Khot, Aranyak Mehta, Yu...
ICLP
2001
Springer
15 years 11 months ago
Fixed-Parameter Complexity of Semantics for Logic Programs
In the paper we establish the xed-parameter complexity for several parameterized decision problems involving models, supported models and stable models of logic programs. We also e...
Zbigniew Lonc, Miroslaw Truszczynski
GBRPR
2007
Springer
16 years 19 days ago
Approximating TSP Solution by MST Based Graph Pyramid
The traveling salesperson problem (TSP) is difficult to solve for input instances with large number of cities. Instead of finding the solution of an input with a large number of c...
Yll Haxhimusa, Walter G. Kropatsch, Zygmunt Pizlo,...
ATAL
2007
Springer
16 years 20 days ago
Children in the forest: towards a canonical problem of spatio-temporal collaboration
Canonical problems are simplified representations of a class of real world problems. They allow researchers to compare algorithms in a standard setting which captures the most im...
Yi Luo, Ladislau Bölöni
RE
2002
Springer
15 years 6 months ago
Relating Software Requirements and Architectures Using Problem Frames
Problem frames provide a means of analyzing and decomposing problems. They emphasise the world outside of the computer, helping the developer to focus on the problem domain, inste...
Jon G. Hall, Michael Jackson, Robin C. Laney, Bash...