485 search results - page 77 / 97 » Unconstraint Assignment Problem: A Molecular Computing Appro... |
JCM
2007
13 years 7 months ago
2007
—Today, most routing problems are solved using Dijkstra’s shortest path algorithm. Many efficient implementations of Dijkstra’s algorithm exist and can handle large networks ...
UIST
2010
ACM
13 years 5 months ago
2010
ACM
An important aspect of making the Web accessible to blind users is ensuring that all important web page elements such as links, clickable buttons, and form fields have explicitly ...
ICTAI
2010
IEEE
13 years 5 months ago
2010
IEEE
A significant body of work in multiagent systems over more than two decades has focused on multi-agent coordination (1). Many challenges in multi-agent coordination can be modeled ...
ML
2010
ACM
13 years 6 months ago
2010
ACM
This paper presents a cooperative evolutionary approach for the problem of instance selection for instance based learning. The presented model takes advantage of one of the most r...
ATVA
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Since testing is inherently incomplete, test selection is of vital importance. Coverage measures evaluate the quality of a test suite and help the tester select test case...