Sciweavers

3229 search results - page 148 / 646
» Theories with the Independence Property
Sort
View
99
Voted
STOC
2002
ACM
124views Algorithms» more  STOC 2002»
16 years 1 months ago
Clairvoyant scheduling of random walks
Two infinite walks on the same finite graph are called compatible if it is possible to introduce delays into them in such a way that they never collide. Years ago, Peter Winkler a...
Péter Gács
108
Voted
ISIPTA
2003
IEEE
15 years 6 months ago
Combining Belief Functions Issued from Dependent Sources
Dempster’s rule for combining two belief functions assumes the independence of the sources of information. If this assumption is questionable, I suggest to use the least speciļ¬...
Marco E. G. V. Cattaneo
78
Voted
GECCO
2003
Springer
129views Optimization» more  GECCO 2003»
15 years 6 months ago
Tournament Selection: Stable Fitness Pressure in XCS
Abstract. Although it is known from GA literature that proportionate selection is subject to many pitfalls, the LCS community somewhat adhered to proportionate selection. Also in t...
Martin Butz, Kumara Sastry, David E. Goldberg
97
Voted
TSP
2008
174views more  TSP 2008»
15 years 21 days ago
Complex ICA Using Nonlinear Functions
We introduce a framework based on Wirtinger calculus for nonlinear complex-valued signal processing such that all computations can be directly carried out in the complex domain. Th...
Tülay Adali, Hualiang Li, Mike Novey, J.-F. C...
112
Voted
ASE
2004
117views more  ASE 2004»
15 years 20 days ago
Model Checking for Combined Logics with an Application to Mobile Systems
In this paper, we develop model checking procedures for three ways of combining (temporal) logics: temporalization, independent combination, and join. We prove that they are termin...
Massimo Franceschet, Angelo Montanari, Maarten de ...