Sciweavers

7228 search results - page 1151 / 1446
» From Algorithmic to Subjective Randomness
Sort
View
C3S2E
2010
ACM
15 years 7 days ago
Scalable formula decomposition for propositional satisfiability
Propositional satisfiability solving, or SAT, is an important reasoning task arising in numerous applications, such as circuit design, formal verification, planning, scheduling or...
Anthony Monnet, Roger Villemaire
74
Voted
CIVR
2008
Springer
141views Image Analysis» more  CIVR 2008»
15 years 7 days ago
Experiments in interactive video search by addition and subtraction
We have developed an interactive video search system that allows the searcher to rapidly assess query results and easily pivot off those results to form new queries. The system i...
John Adcock, Matthew L. Cooper, Jeremy Pickens
88
Voted
HPDC
2010
IEEE
15 years 6 days ago
A data transfer framework for large-scale science experiments
Modern scientific experiments can generate hundreds of gigabytes to terabytes or even petabytes of data that may furthermore be maintained in large numbers of relatively small fil...
Wantao Liu, Brian Tieman, Rajkumar Kettimuthu, Ian...
HPDC
2010
IEEE
15 years 6 days ago
ParaText: scalable text modeling and analysis
Automated analysis of unstructured text documents (e.g., web pages, newswire articles, research publications, business reports) is a key capability for solving important problems ...
Daniel M. Dunlavy, Timothy M. Shead, Eric T. Stant...
GECCO
2008
Springer
201views Optimization» more  GECCO 2008»
15 years 6 days ago
Advanced techniques for the creation and propagation of modules in cartesian genetic programming
The choice of an appropriate hardware representation model is key to successful evolution of digital circuits. One of the most popular models is cartesian genetic programming, whi...
Paul Kaufmann, Marco Platzner
« Prev « First page 1151 / 1446 Last » Next »