Sciweavers

3082 search results - page 488 / 617
» New Bounds for the Controller Problem
Sort
View
STOC
2005
ACM
164views Algorithms» more  STOC 2005»
16 years 6 months ago
Cooperative asynchronous update of shared memory
The Write-All problem for an asynchronous shared-memory system has the objective for the processes to update the contents of a set of shared registers, while minimizing the mber o...
Bogdan S. Chlebus, Dariusz R. Kowalski
STOC
1998
ACM
112views Algorithms» more  STOC 1998»
15 years 10 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
SWAT
1992
Springer
147views Algorithms» more  SWAT 1992»
15 years 10 months ago
Efficient Rebalancing of Chromatic Search Trees
In PODS'91, Nurmi and Soisalon-Soininen presented a new type of binary search tree for databases, which they call a chromatic tree. The aim is to improve runtime performance ...
Joan Boyar, Kim S. Larsen
NIPS
2003
15 years 7 months ago
Max-Margin Markov Networks
In typical classification tasks, we seek a function which assigns a label to a single object. Kernel-based approaches, such as support vector machines (SVMs), which maximize the ...
Benjamin Taskar, Carlos Guestrin, Daphne Koller
GECCO
2006
Springer
215views Optimization» more  GECCO 2006»
15 years 9 months ago
A multi-chromosome approach to standard and embedded cartesian genetic programming
Embedded Cartesian Genetic Programming (ECGP) is an extension of Cartesian Genetic Programming (CGP) that can automatically acquire, evolve and re-use partial solutions in the for...
James Alfred Walker, Julian Francis Miller, Rachel...