Sciweavers

656 search results - page 102 / 132
» Graph Theoretical Characterization and Computation of Answer...
Sort
View
FOCS
2007
IEEE
14 years 1 months ago
Adaptive Simulated Annealing: A Near-optimal Connection between Sampling and Counting
We present a near-optimal reduction from approximately counting the cardinality of a discrete set to approximately sampling elements of the set. An important application of our wo...
Daniel Stefankovic, Santosh Vempala, Eric Vigoda
RTA
2010
Springer
13 years 11 months ago
Automata for Data Words and Data Trees
Data words and data trees appear in verification and XML processing. The term “data” means that positions of the word, or tree, are decorated with elements of an infinite set...
Mikolaj Bojanczyk
DKE
2006
94views more  DKE 2006»
13 years 7 months ago
Extending the data warehouse for service provisioning data
The last few years, there has been an extensive body of literature in data warehousing applications that primarily focuses on basket-type (transactional) data, common in retail in...
Yannis Kotidis
GECCO
2007
Springer
200views Optimization» more  GECCO 2007»
14 years 1 months ago
Performance analysis of niching algorithms based on derandomized-ES variants
A survey of niching algorithms, based on 5 variants of derandomized Evolution Strategies (ES), is introduced. This set of niching algorithms, ranging from the very first derandom...
Ofer M. Shir, Thomas Bäck
VLSID
2002
IEEE
98views VLSI» more  VLSID 2002»
14 years 8 months ago
On Test Scheduling for Core-Based SOCs
We present a mathematical model for the problem of scheduling tests for core-based system-on-chip (SOC) VLSI designs. Given a set of tests for each core in the SOC and a set of te...
Sandeep Koranne