Sciweavers

2095 search results - page 22 / 419

» Improved pebbling bounds

19

COCOON
2009
Springer

139views Combinatorics» more COCOON 2009»

An Improved Time-Space Lower Bound for Tautologies

14 years 4 months ago

An Improved Time-Space Lower Bound for Tautologies

Download pages.cs.wisc.edu

Scott Diehl, Dieter van Melkebeek, Ryan Williams

claim paper

Read More »

18

WAOA
2007
Springer

89views Algorithms» more WAOA 2007»

Improved Lower Bounds for Non-utilitarian Truthfulness

14 years 4 months ago

Improved Lower Bounds for Non-utilitarian Truthfulness

Download www.cs.tau.ac.il

Iftah Gamzu

claim paper

Read More »

20

COLT
2005
Springer

99views Machine Learning» more COLT 2005»

Improved Second-Order Bounds for Prediction with Expert Advice

14 years 3 months ago

Improved Second-Order Bounds for Prediction with Expert Advice

Download homes.dsi.unimi.it

Nicolò Cesa-Bianchi, Yishay Mansour, Gilles...

claim paper

Read More »

24

WAOA
2004
Springer

76views Algorithms» more WAOA 2004»

Improved Bounds for Sum Multicoloring and Scheduling Dependent Jobs with Minsum Criteria

14 years 3 months ago

Improved Bounds for Sum Multicoloring and Scheduling Dependent Jobs with Minsum Criteria

Download www.ru.is

Rajiv Gandhi, Magnús M. Halldórsson,...

claim paper

Read More »

23

DATE
2003
IEEE

100views Hardware» more DATE 2003»

Improving SAT-Based Bounded Model Checking by Means of BDD-Based Approximate Traversals

14 years 3 months ago

Improving SAT-Based Bounded Model Checking by Means of BDD-Based Approximate Traversals

Download www.cs.sfu.ca

: Binary Decision Diagrams (BDDs) have been widely used in synthesis and veriﬁcation. Boolean Satisﬁability (SAT) Solvers, on the other hand, have been gaining

Gianpiero Cabodi, Sergio Nocco, Stefano Quer

claim paper

Read More »

« Prev « First page 22 / 419 Last » Next »