2137 search results - page 333 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
119
Voted
GECCO
2007
Springer
15 years 8 months ago
2007
Springer
The modeling and analysis of large networks of autonomous agents is an important topic with applications in many different disciplines. One way of modeling the development of such...
130
click to vote
ENC
2005
IEEE
15 years 8 months ago
2005
IEEE
Generally, evolutionary algorithms require a large number of evaluations of the objective function in order to obtain a good solution. This paper presents a simple approach to sav...
110
Voted
STOC
2003
ACM
16 years 2 months ago
2003
ACM
Let H be a fixed directed graph on h vertices, let G be a directed graph on n vertices and suppose that at least n2 edges have to be deleted from it to make it H-free. We show tha...
107
Voted
ATAL
2008
Springer
15 years 4 months ago
2008
Springer
We present an extension of the Dynamics Based Control (DBC) paradigm to environment models based on Predictive State Representations (PSRs). We show an approximate greedy version ...
107
Voted
SECON
2010
IEEE
15 years 14 days ago
2010
IEEE
In this paper, we address several problems that arise in the context of rotating directional sensors. Rotating directional sensors (RDS) have a "directional" coverage reg...