Sciweavers

4860 search results - page 331 / 972
» SNPs Problems, Complexity, and Algorithms
Sort
View
ATAL
2005
Springer
15 years 6 months ago
Efficient information retrieval using mobile agents
We are concerned with the use of Mobile Agents for information retrieval. A multi-agent system is considered; a number of agents are involved in a collective effort to retrieve di...
Irene Sygkouna, Miltiades E. Anagnostou
CONSTRAINTS
2007
93views more  CONSTRAINTS 2007»
15 years 1 months ago
Arc-B-consistency of the Inter-distance Constraint
We study the “inter-distance constraint”, also known as the global minimum distance constraint, that ensures that the distance between any pair of variables is at least equal ...
Konstantin Artiouchine, Philippe Baptiste
108
Voted
WG
2010
Springer
14 years 11 months ago
Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time
The problem of determining the cutwidth of a graph is a notoriously hard problem which remains NP-complete under severe restrictions on input graphs. Until recently, non-trivial p...
Pinar Heggernes, Pim van 't Hof, Daniel Lokshtanov...
219
Voted
ICC
2011
IEEE
272views Communications» more  ICC 2011»
14 years 19 days ago
Dynamic Anycast Routing and Wavelength Assignment in WDM Networks Using Ant Colony Optimization (ACO)
—Ant colony optimization (ACO) is a probabilistic technique used for solving complex computational problems, such as finding optimal routes in networks. It has been proved to pe...
Kavitha Bhaskaran, Joan Triay, Vinod Vokkarane
MM
2005
ACM
103views Multimedia» more  MM 2005»
15 years 6 months ago
Diorama table
“diorama table “ is an interactive table installation. People place physical objects on the table and projected elements such as trains, cars, houses, and trees appear and are...
Keiko Takahashi, Shinji Sasada