Sciweavers

461 search results - page 37 / 93
» Practical polynomial factoring in polynomial time
Sort
View
APPROX
2008
Springer
127views Algorithms» more  APPROX 2008»
14 years 11 months ago
Approximating Single Machine Scheduling with Scenarios
In the field of robust optimization, the goal is to provide solutions to combinatorial problems that hedge against variations of the numerical parameters. This constitutes an effor...
Monaldo Mastrolilli, Nikolaus Mutsanas, Ola Svenss...
KI
2007
Springer
15 years 3 months ago
Pinpointing in the Description Logic EL+
Axiom pinpointing has been introduced in description logics (DLs) to help the user understand the reasons why consequences hold by computing minimal subsets of the knowledge base t...
Franz Baader, Rafael Peñaloza, Boontawee Su...
FOSSACS
2011
Springer
14 years 1 months ago
Minimizing Deterministic Lattice Automata
Traditional automata accept or reject their input, and are therefore Boolean. In contrast, weighted automata map each word to a value from a semiring over a large domain. The speci...
Shulamit Halamish, Orna Kupferman
SENSYS
2005
ACM
15 years 3 months ago
Estimating clock uncertainty for efficient duty-cycling in sensor networks
Radio duty cycling has received significant attention in sensor networking literature, particularly in the form of protocols for medium access control and topology management. Whi...
Saurabh Ganeriwal, Deepak Ganesan, Hohyun Shim, Vl...
MOBICOM
2006
ACM
15 years 3 months ago
On the complexity of scheduling in wireless networks
We consider the problem of throughput-optimal scheduling in wireless networks subject to interference constraints. We model the interference using a family of K-hop interference m...
Gaurav Sharma, Ravi R. Mazumdar, Ness B. Shroff