Sciweavers

1208 search results - page 65 / 242
» Uniform eventown problems
Sort
View
GECCO
2006
Springer
158views Optimization» more  GECCO 2006»
15 years 1 months ago
Exploring network topology evolution through evolutionary computations
We present an evolutionary methodology that explores the evolution of network topology when a uniform growth of the network traffic is considered. The network redesign problem is ...
Sami J. Habib, Alice C. Parker
FLAIRS
2001
14 years 11 months ago
Validity of First-Order Knowledge Bases
A knowledge base is maintained by modifying its conceptual model and by using those modifications to specify changes to its implementation. The maintenance problem is to determine...
John K. Debenham
AAAI
2000
14 years 11 months ago
A Flexible Framework for Defeasible Logics
Logics for knowledge representation suffer from overspecialization: while each logic may provide an ideal representation formalism for some problems, it is less than optimal for o...
Grigoris Antoniou, David Billington, Guido Governa...
57
Voted
CORR
2008
Springer
118views Education» more  CORR 2008»
14 years 10 months ago
Learning Low-Density Separators
Abstract. We define a novel, basic, unsupervised learning problem learning the the lowest density homogeneous hyperplane separator of an unknown probability distribution. This task...
Shai Ben-David, Tyler Lu, Dávid Pál,...
91
Voted
AAECC
2005
Springer
131views Algorithms» more  AAECC 2005»
14 years 10 months ago
Noisy interpolation of sparse polynomials in finite fields
Abstract We consider a polynomial analogue of the hidden number problem introduced by Boneh andVenkatesan, namely the sparse polynomial noisy interpolation problem of recovering an...
Igor Shparlinski, Arne Winterhof