Sciweavers

16596 search results - page 434 / 3320
» Generalized Assignment Problems
Sort
View
GECCO
2006
Springer
166views Optimization» more  GECCO 2006»
15 years 11 months ago
Solving identification problem for asynchronous finite state machines using genetic algorithms
A Genetic Algorithm, embedded in a simulation-based method, is applied to the identification of Asynchronous Finite State Machines. Two different coding schemes and their associat...
Xiaojun Geng
BIRTHDAY
2010
Springer
15 years 8 months ago
Metrization Theorem for Space-Times: From Urysohn's Problem towards Physically Useful Constructive Mathematics
In the early 1920s, Pavel Urysohn proved his famous lemma (sometimes referred to as "first non-trivial result of point set topology"). Among other applications, this lemm...
Vladik Kreinovich
MCSS
2006
Springer
15 years 7 months ago
A lattice approach to analysis and synthesis problems
Within a lattice approach, the purpose of this paper is to give general necessary and sufficient conditions for internal stabilizability and for the existence of (weakly) left-/rig...
Alban Quadrat
STOC
2000
ACM
174views Algorithms» more  STOC 2000»
15 years 12 months ago
Noise-tolerant learning, the parity problem, and the statistical query model
We describe a slightly subexponential time algorithm for learning parity functions in the presence of random classification noise, a problem closely related to several cryptograph...
Avrim Blum, Adam Kalai, Hal Wasserman
AMAI
1999
Springer
15 years 7 months ago
STCSP - Structured Temporal Constraint satisfaction Problems
Temporal Constraint Satisfaction Problems (TCSP) is a well known approach for representing and processing temporal knowledge. Important properties of the knowledge can be inferred...
Mira Balaban, Tzachi Rosen