Sciweavers

1368 search results - page 90 / 274
» Generalized Rook Polynomials
Sort
View
GECCO
2005
Springer
117views Optimization» more  GECCO 2005»
15 years 10 months ago
Extending XCSF beyond linear approximation
XCSF is the extension of XCS in which classifier prediction is computed as a linear combination of classifier inputs and a weight vector associated to each classifier. XCSF can...
Pier Luca Lanzi, Daniele Loiacono, Stewart W. Wils...
SWAT
2004
Springer
138views Algorithms» more  SWAT 2004»
15 years 9 months ago
Faster Deterministic Gossiping in Directed Ad Hoc Radio Networks
Abstract. We study the gossiping problem in directed ad-hoc radio networks. Our main result is a deterministic algorithm that solves this problem in an n-node network in time O(n4/...
Leszek Gasieniec, Tomasz Radzik, Qin Xin
ICALP
2001
Springer
15 years 9 months ago
Separating Quantum and Classical Learning
We consider a model of learning Boolean functions from quantum membership queries. This model was studied in [26], where it was shown that any class of Boolean functions which is i...
Rocco A. Servedio
STOC
1998
ACM
129views Algorithms» more  STOC 1998»
15 years 8 months ago
Planar Map Graphs
We introduce and study a modi ed notion of planarity, in which two regions of a map are considered adjacent when they share any point of their boundaries not an edge, as standard...
Zhi-Zhong Chen, Michelangelo Grigni, Christos H. P...
STACS
1994
Springer
15 years 8 months ago
On the Complexity of the Maximum Cut Problem
The complexity of the simple maxcut problem is investigated for several special classes of graphs. It is shown that this problem is NP-complete when restricted to one of the follo...
Hans L. Bodlaender, Klaus Jansen