113 search results - page 17 / 23 » What can the GC compute efficiently |
AIPS
2010
14 years 4 days ago
2010
Factored planning methods aim to exploit locality to efficiently solve large but "loosely coupled" planning problems by computing solutions locally and propagating limit...
VCIP
2000
13 years 11 months ago
2000
The concentric mosaics offer a quick solution to the construction and navigation of a virtual environment. To reduce the vast data amount of the concentric mosaics, a compression ...
COMPSEC
2008
13 years 10 months ago
2008
Short Message Service is usually used to transport unclassified information, but with the rise of mobile commerce it has become an integral tool for conducting business. However S...
COR
2008
2008
Observations in using parallel and sequential evolutionary algorithms for automatic software testing
13 years 10 months ago
In this paper we analyze the application of parallel and sequential evolutionary algorithms (EAs) to the automatic test data generation problem. The problem consists of automatica...
CVIU
2004
13 years 9 months ago
2004
This study presents a content-based image retrieval system IMALBUM based on local region of interest called object of interest (OOI). Each segmented or user-selected OOI is indexe...