1798 search results - page 321 / 360 » A Tree for All Seasons |
SODA
2003
ACM
13 years 9 months ago
2003
ACM
We give a 7.18-approximation algorithm for the minimum latency problem that uses only O(n log n) calls to the prize-collecting Steiner tree (PCST) subroutine of Goemans and Willia...
LISA
2000
13 years 9 months ago
2000
Most denial-of-service attacks are characterized by a flood of packets with random, apparently valid source addresses. These addresses are spoofed, created by a malicious program ...
ATAL
2010
Springer
13 years 8 months ago
2010
Springer
In this paper, we propose a Quantified Distributed Constraint Optimization problem (QDCOP) that extends the framework of Distributed Constraint Optimization problems (DCOPs). DCOP...
GECCO
2010
Springer
13 years 8 months ago
2010
Springer
Most highly accurate predictive modeling techniques produce opaque models. When comprehensible models are required, rule extraction is sometimes used to generate a transparent mod...
AI
2010
Springer
13 years 7 months ago
2010
Springer
Combining constraints using logical connectives such as disjunction is ubiquitous in constraint programming, because it adds considerable expressive power to a constraint language...