Sciweavers

12452 search results - page 2152 / 2491
» An exploration of program as language
Sort
View
ICALP
2004
Springer
16 years 26 days ago
Quantum Query Complexity of Some Graph Problems
Quantum algorithms for graph problems are considered, both in the adjacency matrix model and in an adjacency list-like array model. We give almost tight lower and upper bounds for ...
Christoph Dürr, Mark Heiligman, Peter H&oslas...
ICALP
2004
Springer
16 years 26 days ago
Easily Refutable Subformulas of Large Random 3CNF Formulas
Abstract. A simple nonconstructive argument shows that most 3CNF formulas with cn clauses (where c is a large enough constant) are not satisfiable. It is an open question whether ...
Uriel Feige, Eran Ofek
162
Voted
ICALP
2004
Springer
16 years 26 days ago
Games with Winning Conditions of High Borel Complexity
We first consider infinite two-player games on pushdown graphs. In previous work, Cachat, Duparc and Thomas [4] have presented a winning decidable condition that is Σ3-complete ...
Olivier Serre
ICCS
2004
Springer
16 years 26 days ago
Data Driven Design Optimization Methodology Development and Application
The Data Driven Design Optimization Methodology (DDDOM) is a Dynamic Data Driven Application System (DDDAS) developed for engineering design optimization. The DDDOM synergizes expe...
H. Zhao, D. Knight, E. Taskinoglu, V. Jovanovic
166
Voted
IFIP
2004
Springer
16 years 26 days ago
ATV: An Efficient Method for Constructing a Certification Path
: Constructing a certification path is the mainly method of validating a certificate at given time. The established path will consist of all the valid certificates that reside betw...
Omar Batarfi
« Prev « First page 2152 / 2491 Last » Next »