Sciweavers

13376 search results - page 525 / 2676
» Problem Solving with
Sort
View
EUROCOLT
1999
Springer
15 years 11 months ago
Query by Committee, Linear Separation and Random Walks
Abstract. Recent works have shown the advantage of using Active Learning methods, such as the Query by Committee (QBC) algorithm, to various learning problems. This class of Algori...
Ran Bachrach, Shai Fine, Eli Shamir
CCE
2004
15 years 7 months ago
An MPEC formulation for dynamic optimization of distillation operations
We consider the dynamic optimization of chemical processes with changes in the number of equilibrium phases. Recent work has shown that transitions in the number of phases can be ...
Arvind U. Raghunathan, M. Soledad Diaz, Lorenz T. ...
CSCLP
2007
Springer
16 years 1 months ago
Quasi-Linear-Time Algorithms by Generalisation of Union-Find in CHR
Abstract. The union-find algorithm can be seen as solving simple equations between variables or constants. With a few lines of code change, we generalise its implementation in CHR...
Thom W. Frühwirth
ANTS
2006
Springer
78views Algorithms» more  ANTS 2006»
15 years 11 months ago
Hidden Pairings and Trapdoor DDH Groups
This paper suggests a new building block for cryptographic protocols and gives two instantiations of it. The concept is to generate two descriptions of the same group: a public des...
Alexander W. Dent, Steven D. Galbraith
GI
2007
Springer
15 years 11 months ago
Coordination of Interdependent Planning Systems, a Case Study
: The decomposition of planning and scheduling problems is a well known technique to make these problems tractable. The resulting dependable subproblems were often solved using dif...
Leif Meier, René Schumann