Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
2
search results - page 1 / 1
»
Deeper Bound in BMC by Combining Constant Propagation and Ab...
Sort
relevance
views
votes
recent
update
View
thumb
title
19
click to vote
ASPDAC
2007
ACM
139
views
Hardware
»
more
ASPDAC 2007
»
Deeper Bound in BMC by Combining Constant Propagation and Abstraction
13 years 11 months ago
Download
www.cecs.uci.edu
ound in BMC by Combining Constant Propagation and Abstraction Roy Armoni, Limor Fix1 , Ranan Fraer1 , Tamir Heyman1,3 , Moshe Vardi2 , Yakir Vizel1 , Yael Zbar1 1 Logic and Validat...
Roy Armoni, Limor Fix, Ranan Fraer, Tamir Heyman, ...
claim paper
Read More »
24
click to vote
DC
2008
101
views
Internet Technology
»
more
DC 2008
»
Fast computation by population protocols with a leader
13 years 7 months ago
Download
www.cs.yale.edu
Fast algorithms are presented for performing computations in a probabilistic population model. This is a variant of the standard population protocol model--in which finite-state ag...
Dana Angluin, James Aspnes, David Eisenstat
claim paper
Read More »
« Prev
« First
page 1 / 1
Last »
Next »