Sciweavers

200 search results - page 15 / 40
» ipl 2006
Sort
View
IPL
2002
110views more  IPL 2002»
14 years 9 months ago
New bounds on a hypercube coloring problem
In studying the scalability of optical networks, one problem which arises involves coloring the vertices of the n-cube with as few colors as possible such that any two vertices wh...
Hung Q. Ngo, Ding-Zhu Du, Ronald L. Graham
IPL
2002
98views more  IPL 2002»
14 years 9 months ago
Evolutionary induced decision trees for dangerous software modules prediction
We study the possibility of constructing decision trees with evolutionary algorithms in order to increase their predictive accuracy. We present a self-adapting evolutionary algori...
Vili Podgorelec, Peter Kokol
IPL
2002
80views more  IPL 2002»
14 years 9 months ago
A note on models for non-probabilistic analysis of packet switching networks
We consider two models commonly used in the literature to model adversarial injection of packets into a packet switching network. We establish the relation between these two types...
Adi Rosén
IPL
1998
95views more  IPL 1998»
14 years 9 months ago
A Variation on the Zero-One Law
Given a decision problem P and a probability distribution over binary strings, for each n, draw independently an instance xn of P of length n. What is the probability that there i...
Andreas Blass, Yuri Gurevich, Vladik Kreinovich, L...
IPL
2010
82views more  IPL 2010»
14 years 8 months ago
New upper bounds on the Boolean circuit complexity of symmetric functions
In this note, we present improved upper bounds on the circuit complexity of symmetric Boolean functions. In particular, we describe circuits of size 4.5n + o(n) for any symmetric ...
E. Demenkov, Arist Kojevnikov, Alexander S. Kuliko...