Sciweavers

2657 search results - page 245 / 532
» On the complexity of hierarchical problem solving
Sort
View
SIGACT
2008
103views more  SIGACT 2008»
15 years 1 months ago
Computational geometry column 50
Two long-open problems have been solved: (1) every sufficiently large planar point set in general position contains the vertices of an empty hexagon; (2) every finite collection o...
Joseph O'Rourke
ISSA
2004
15 years 3 months ago
Applying Similarities Between Immune Systems And Mobile Agent Systems In Intrusion Detection
Nearly all present-day commercial intrusion detection systems are based on a hierarchical architecture. Nodes at the bottom of the hierarchy collect information, which is passed t...
Marek Zielinski
ATAL
2005
Springer
15 years 7 months ago
From team plan to individual plans: a petri net-based approach
This paper focuses on a framework for representing a team plan and its projections on individual agents. The team plan is represented with a coloured Petri net. Using the implicit...
Olivier Bonnet-Torrés, Catherine Tessier
ICML
2009
IEEE
16 years 2 months ago
Efficient Euclidean projections in linear time
We consider the problem of computing the Euclidean projection of a vector of length n onto a closed convex set including the 1 ball and the specialized polyhedra employed in (Shal...
Jun Liu, Jieping Ye
DCOSS
2005
Springer
15 years 7 months ago
A Local Facility Location Algorithm for Sensor Networks
In this paper we address a well-known facility location problem (FLP) in a sensor network environment. The problem deals with finding the optimal way to provide service to a (poss...
Denis Krivitski, Assaf Schuster, Ran Wolff