Sciweavers

2766 search results - page 385 / 554
» Algorithms for trigonometric polynomials
Sort
View
APPROX
2006
Springer
162views Algorithms» more  APPROX 2006»
15 years 8 months ago
Approximating Precedence-Constrained Single Machine Scheduling by Coloring
Abstract. This paper investigates the relationship between the dimension theory of partial orders and the problem of scheduling precedenceconstrained jobs on a single machine to mi...
Christoph Ambühl, Monaldo Mastrolilli, Ola Sv...
ICALP
1998
Springer
15 years 8 months ago
A Neuroidal Architecture for Cognitive Computation
An architecture is described for designing systems that acquire and manipulate large amounts of unsystematized, or so-called commonsense, knowledge. Its aim is to exploit to the fu...
Leslie G. Valiant
COLT
1995
Springer
15 years 8 months ago
On the Learnability and Usage of Acyclic Probabilistic Finite Automata
We propose and analyze a distribution learning algorithm for a subclass of Acyclic Probabilistic Finite Automata (APFA). This subclass is characterized by a certain distinguishabi...
Dana Ron, Yoram Singer, Naftali Tishby
GECCO
2008
Springer
124views Optimization» more  GECCO 2008»
15 years 5 months ago
Runtime analysis of binary PSO
We investigate the runtime of the Binary Particle Swarm Optimization (PSO) algorithm introduced by Kennedy and Eberhart (1997). The Binary PSO maintains a global best solution and...
Dirk Sudholt, Carsten Witt
CORR
2010
Springer
144views Education» more  CORR 2010»
15 years 4 months ago
Efficient Minimization of Decomposable Submodular Functions
Many combinatorial problems arising in machine learning can be reduced to the problem of minimizing a submodular function. Submodular functions are a natural discrete analog of co...
Peter Stobbe, Andreas Krause