Sciweavers

2266 search results - page 161 / 454
» Some Solutions to the Ignoring Problem
Sort
View
FGCS
2000
145views more  FGCS 2000»
15 years 6 months ago
Ant algorithms and stigmergy
Ant colonies, and more generally social insect societies, are distributed systems that, in spite of the simplicity of their individuals, present a highly structured social organiz...
Marco Dorigo, Eric Bonabeau, Guy Theraulaz
ICRA
2005
IEEE
141views Robotics» more  ICRA 2005»
16 years 4 days ago
On Computing Complex Navigation Functions
— This paper addresses the problem of efficiently computing robot navigation functions. Navigation functions are potential functions free of spurious local minima that present a...
Luciano C. A. Pimenta, Alexandre R. Fonseca, Guilh...
CPM
2004
Springer
110views Combinatorics» more  CPM 2004»
15 years 12 months ago
Finding Biclusters by Random Projections
Given a matrix X composed of symbols, a bicluster is a submatrix of X obtained by removing some of the rows and some of the columns of X in such a way that each row of what is lef...
Stefano Lonardi, Wojciech Szpankowski, Qiaofeng Ya...
FEWS
2007
15 years 8 months ago
Towards a Semantic Contact Management
Many organizations face every day the problem of effectively managing their contacts (customers, suppliers, partners, etc.), in terms of communication, clustering, networking, ana...
Irene Celino, Francesco Corcoglioniti, Emanuele De...
ESM
2000
15 years 7 months ago
SEP: Simulation framework to evaluate digital hardware architectures
Know-how is the most useful mean for designing new processors before a complete hardware description. The integration rate is increasing very quickly and the timeto-market has to ...
Frédéric Mallet, Fernand Boér...