406 search results - page 55 / 82 » Pseudorandomness and Combinatorial Constructions |
160
click to vote
STACS
2007
Springer
16 years 6 days ago
2007
Springer
: Hard metrics are the class of extremal metrics with respect to embedding into Euclidean spaces: they incur Ω(logn) multiplicative distortion, which is as large as it can possib...
177
click to vote
IWCMC
2006
ACM
16 years 1 days ago
2006
ACM
This paper presents a neural network model for routing in the space segment of a Satellite Personal Communication System. At first, a proper energy function is constructed from th...
150
click to vote
GECCO
2005
Springer
15 years 11 months ago
2005
Springer
This paper proposes an incremental approach for building solutions using evolutionary computation. It presents a simple evolutionary model called a Transition model in which parti...
141
click to vote
WCC
2005
Springer
15 years 11 months ago
2005
Springer
In this paper, we discuss some methods of constructing frequency/time hopping (FH/TH) sequences over GF(pk ) by taking successive k-tuples of given sequences over GF(p). We are abl...
140
click to vote
ICESS
2004
Springer
15 years 11 months ago
2004
Springer
Recent work showed that staging and abstract interpretation can be used to derive correct families of combinatorial circuits, and illustrated this technique with an in-depth analys...