Sciweavers

1355 search results - page 43 / 271
» Alternating Timed Automata over Bounded Time
Sort
View
WADS
1989
Springer
84views Algorithms» more  WADS 1989»
13 years 11 months ago
Skip Lists: A Probabilistic Alternative to Balanced Trees
rees can be used for representing abstract data types such as dictionaries and ordered lists. They work well when the elements are inserted in a random order. Some sequences of ope...
William Pugh
HICSS
1997
IEEE
104views Biometrics» more  HICSS 1997»
13 years 12 months ago
A Simulation Tool for Analysis of Alternative Paradigms for the New Electricity Business
Variousproposals have been madefor new paradigms for operating the restructuring electrical system. One of the key challenges associated with this restructuring is to effectively ...
Thomas J. Overbye, Peter W. Sauer, George Gross, M...
GECCO
2006
Springer
205views Optimization» more  GECCO 2006»
13 years 11 months ago
Alternative evolutionary algorithms for evolving programs: evolution strategies and steady state GP
In contrast with the diverse array of genetic algorithms, the Genetic Programming (GP) paradigm is usually applied in a relatively uniform manner. Heuristics have developed over t...
L. Darrell Whitley, Marc D. Richards, J. Ross Beve...
MOR
2010
120views more  MOR 2010»
13 years 6 months ago
Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Lojasiewicz In
We study the convergence properties of an alternating proximal minimization algorithm for nonconvex structured functions of the type: L(x, y) = f(x)+Q(x, y)+g(y), where f : Rn → ...
Hedy Attouch, Jérôme Bolte, Patrick R...
JUCS
2010
161views more  JUCS 2010»
13 years 6 months ago
Evaluating Linear XPath Expressions by Pattern-Matching Automata
: We consider the problem of efficiently evaluating a large number of XPath expressions, especially in the case when they define subscriber profiles for filtering of XML documen...
Panu Silvasti, Seppo Sippu, Eljas Soisalon-Soinine...