Sciweavers

1369 search results - page 246 / 274
» Lattice computations for random numbers
Sort
View
FCT
2003
Springer
14 years 2 months ago
On Boundaries of Highly Visible Spaces and Applications
The purpose of this paper is to investigate the properties of a certain class of highly visible spaces. For a given geometric space C containing obstacles specified by disjoint s...
John H. Reif, Zheng Sun
GECCO
2010
Springer
155views Optimization» more  GECCO 2010»
14 years 1 months ago
Negative selection algorithms without generating detectors
Negative selection algorithms are immune-inspired classifiers that are trained on negative examples only. Classification is performed by generating detectors that match none of ...
Maciej Liskiewicz, Johannes Textor
LICS
2000
IEEE
14 years 1 months ago
Concurrent Omega-Regular Games
We consider two-player games which are played on a finite state space for an infinite number of rounds. The games are concurrent, that is, in each round, the two players choose ...
Luca de Alfaro, Thomas A. Henzinger
EPEW
2007
Springer
14 years 23 days ago
An Efficient Counter-Based Broadcast Scheme for Mobile Ad Hoc Networks
In mobile ad hoc networks (MANETs), broadcasting plays a fundamental role, diffusing a message from a given source node to all the other nodes in the network. Flooding is the simpl...
Aminu Mohammed, Mohamed Ould-Khaoua, Lewis M. Mack...
COCO
2006
Springer
93views Algorithms» more  COCO 2006»
14 years 17 days ago
Making Hard Problems Harder
We consider a general approach to the hoary problem of (im)proving circuit lower bounds. We define notions of hardness condensing and hardness extraction, in analogy to the corres...
Joshua Buresh-Oppenheim, Rahul Santhanam