2877 search results - page 521 / 576 » Complex Decision Making Processes: their Modelling and Suppo... |
STOC
2010
ACM
14 years 1 months ago
2010
ACM
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...
COMPGEOM
2005
ACM
13 years 10 months ago
2005
ACM
Let S be a set of n points moving on the real line. The kinetic sorting problem is to maintain a data structure on the set S that makes it possible to quickly generate a sorted li...
ISCA
2010
IEEE
14 years 1 months ago
2010
IEEE
As technology scales ever further, device unreliability is creating excessive complexity for hardware to maintain the illusion of perfect operation. In this paper, we consider whe...
ANCS
2008
ACM
13 years 11 months ago
2008
ACM
Over the last decade, programmable Network Processors (NPs) have become widely used in Internet routers and other network components. NPs enable rapid development of complex packe...
JUCS
2007
13 years 8 months ago
2007
: Ad hoc wireless networks have enormous commercial and military potential because of their self-organizing capacity and mobility support. However, some specificities of these net...