Sciweavers

2905 search results - page 268 / 581
» Formal Memetic Algorithms
Sort
View
100
Voted
WWW
2007
ACM
15 years 11 months ago
Toward expressive syndication on the web
Syndication systems on the Web have attracted vast amounts of attention in recent years. As technologies have emerged and matured, there has been a transition to more expressive s...
Christian Halaschek-Wiener, James A. Hendler
WWW
2005
ACM
15 years 11 months ago
Web service interfaces
We present a language for specifying web service interfaces. A web service interface puts three kinds of constraints on the users of the service. First, the interface specifies th...
Dirk Beyer, Arindam Chakrabarti, Thomas A. Henzing...
ICCAD
2003
IEEE
99views Hardware» more  ICCAD 2003»
15 years 4 months ago
A Probabilistic Approach to Buffer Insertion
This work presents a formal probabilistic approach for solving optimization problems in design automation. Prediction accuracy is very low especially at high levels of design flo...
Vishal Khandelwal, Azadeh Davoodi, Akash Nanavati,...
STOC
1998
ACM
112views Algorithms» more  STOC 1998»
15 years 3 months ago
Quantum Circuits with Mixed States
Current formal models for quantum computation deal only with unitary gates operating on “pure quantum states”. In these models it is difficult or impossible to deal formally w...
Dorit Aharonov, Alexei Kitaev, Noam Nisan
192
Voted
LCC
1994
248views Algorithms» more  LCC 1994»
15 years 3 months ago
Comparing the Power of Monadic NP Games
The descriptive complexity of a problem is the complexity of describing the problem in some logical formalism. One of the few techniques for proving separation results in descripti...
Ronald Fagin