Sciweavers

16404 search results - page 691 / 3281
» A set coverage problem
Sort
View
JCT
2008
83views more  JCT 2008»
15 years 7 months ago
Bounds on degrees of p-adic separating polynomials
We study a discrete optimization problem introduced by Babai, Frankl, Kutin, and Stefankovic (2001), which provides bounds on degrees of polynomials with p-adically controlled beh...
Daniel J. Katz, Joshua Zahl
IPL
2007
125views more  IPL 2007»
15 years 7 months ago
State explosion in almost-sure probabilistic reachability
We show that the problem of reaching a state set with probability 1 in probabilisticnondeterministic systems operating in parallel is EXPTIME-complete. We then show that this prob...
François Laroussinie, Jeremy Sproston
DAC
2007
ACM
16 years 8 months ago
An Effective Guidance Strategy for Abstraction-Guided Simulation
tive Guidance Strategy for Abstraction-Guided Simulation Flavio M. De Paula Alan J. Hu Department of Computer Science, University of British Columbia, {depaulfm, ajh}@cs.ubc.ca D...
Flavio M. de Paula, Alan J. Hu
SIGSOFT
2007
ACM
16 years 8 months ago
Program representations for testing wireless sensor network applications
Because of the growing complexity of wireless sensor network applications (WSNs), traditional software development tools are being developed that are specifically designed for the...
Nguyet T. M. Nguyen, Mary Lou Soffa
WWW
2005
ACM
16 years 8 months ago
Algorithmic detection of semantic similarity
Automatic extraction of semantic information from text and links in Web pages is key to improving the quality of search results. However, the assessment of automatic semantic meas...
Ana Gabriela Maguitman, Filippo Menczer, Heather R...