Sciweavers

101 search results - page 13 / 21
» Domination Problems in Nowhere-Dense Classes
Sort
View
IJCAI
2007
13 years 8 months ago
Mechanism Design with Partial Revelation
Classic direct mechanisms require full type (or utility) revelation from participating agents, something that can be very difficult in practical multi-attribute settings. In this...
Nathanael Hyafil, Craig Boutilier
AIPS
2003
13 years 8 months ago
Optimal Rectangle Packing: Initial Results
Given a set of rectangles with fixed orientations, we want to find an enclosing rectangle of minimum area that contains them all with no overlap. Many simple scheduling tasks ca...
Richard E. Korf
ICASSP
2010
IEEE
13 years 7 months ago
Statistical modeling of co-channel interference in a field of Poisson distributed interferers
—With increasing spatial reuse of the radio spectrum, co-channel interference is becoming a dominant noise source and may severely degrade the communication performance of wirele...
Kapil Gulati, Brian L. Evans, Keith R. Tinsley
KBSE
2009
IEEE
14 years 2 months ago
Loopfrog: A Static Analyzer for ANSI-C Programs
—Practical software verification is dominated by two major classes of techniques. The first is model checking, which provides total precision, but suffers from the state space ...
Daniel Kroening, Natasha Sharygina, Stefano Tonett...
FOCS
2008
IEEE
14 years 1 months ago
Constant-Time Approximation Algorithms via Local Improvements
We present a technique for transforming classical approximation algorithms into constant-time algorithms that approximate the size of the optimal solution. Our technique is applic...
Huy N. Nguyen, Krzysztof Onak