Sciweavers

1363 search results - page 147 / 273
» The road coloring problem
Sort
View
TIT
2002
57views more  TIT 2002»
15 years 6 months ago
Writing sequences on the plane
The problem of arranging two-dimensional arrays of data into one-dimensional sequences comes up in image processing, color quantization, and optical and magnetic data recording. A ...
Emina Soljanin
SIAMDM
2010
123views more  SIAMDM 2010»
15 years 4 months ago
Large Bichromatic Point Sets Admit Empty Monochromatic 4-Gons
We consider a variation of a problem stated by Erd˝os and Szekeres in 1935 about the existence of a number fES (k) such that any set S of at least fES (k) points in general posit...
Oswin Aichholzer, Thomas Hackl, Clemens Huemer, Fe...
PROCEDIA
2010
127views more  PROCEDIA 2010»
15 years 1 months ago
Web service selection for transactional composition
In this work we address the issue of selecting and composing Web Services (WSs) considering functional requirements and transactional properties. We formalize the WS composition p...
Yudith Cardinale, Joyce El Haddad, Maude Manouvrie...
ICALP
2009
Springer
16 years 6 months ago
Improved Algorithms for Latency Minimization in Wireless Networks
In the interference scheduling problem, one is given a set of n communication requests described by sourcedestination pairs of nodes from a metric space. The nodes correspond to d...
Alexander Fanghänel, Berthold Vöcking, T...
ASP
2005
Springer
15 years 12 months ago
A New Algorithm for Answer Set Computation
A new exact algorithm for computing answer sets of logic programs is presented and analyzed. The algorithm takes a logic program in Kernel normal form as an input and computes its ...
Giuliano Grossi, Massimo Marchi