Sciweavers

895 search results - page 130 / 179
» Using graphs for some discrete tomography problems
Sort
View
GECCO
2007
Springer
241views Optimization» more  GECCO 2007»
15 years 4 months ago
Binary ant algorithm
When facing dynamic optimization problems the goal is no longer to find the extrema, but to track their progression through the space as closely as possible. Over these kind of ov...
Carlos Fernandes, Agostinho C. Rosa, Vitorino Ramo...
APPROX
2004
Springer
149views Algorithms» more  APPROX 2004»
15 years 3 months ago
Edge Coloring with Delays
Consider the following communication problem, that leads to a new notion of edge coloring. The communication network is represented by a bipartite multigraph, where the nodes on o...
Noga Alon, Vera Asodi
MOBICOM
2012
ACM
13 years 15 days ago
MARVEL: multiple antenna based relative vehicle localizer
Access to relative location of nearby vehicles on the local roads or on the freeways is useful for providing critical alerts to the drivers, thereby enhancing their driving experi...
Dong Li, Tarun Bansal, Zhixue Lu, Prasun Sinha
ANTSW
2004
Springer
15 years 1 months ago
Mesh-Partitioning with the Multiple Ant-Colony Algorithm
ed Abstract We present two heuristic mesh-partitioning methods, both of which build on the multiple ant-colony algorithm in order to improve the quality of the mesh partitions. The...
Peter Korosec, Jurij Silc, Borut Robic
IAT
2009
IEEE
15 years 1 months ago
Developing a Deterministic Patrolling Strategy for Security Agents
Abstract—Developing autonomous systems that patrol environments for detecting intruders is a topic of increasing relevance in security applications. An important aspect of these ...
Nicola Basilico, Nicola Gatti, Francesco Amigoni