Sciweavers

2657 search results - page 137 / 532
» On the complexity of hierarchical problem solving
Sort
View
IEEEPACT
2006
IEEE
15 years 7 months ago
Program generation for the all-pairs shortest path problem
A recent trend in computing are domain-specific program generators, designed to alleviate the effort of porting and reoptimizing libraries for fast-changing and increasingly com...
Sung-Chul Han, Franz Franchetti, Markus Püsch...
GECCO
2005
Springer
131views Optimization» more  GECCO 2005»
15 years 7 months ago
Genetic algorithms for the sailor assignment problem
This paper examines a real-world application of genetic algorithms – solving the United States Navy’s Sailor Assignment Problem (SAP). The SAP is a complex assignment problem ...
Deon Garrett, Joseph Vannucci, Rodrigo Silva, Dipa...
DOCENG
2008
ACM
15 years 3 months ago
Keeping a digital library clean: new solutions to old problems
Digital Libraries are complex information systems that involve rich sets of digital objects and their respective metadata, along with multiple organizational structures and servic...
Alberto H. F. Laender, Marcos André Gon&cce...
LWA
2007
15 years 3 months ago
Retrieval of technical drawings in DXF format - concepts and problems
Nowadays, launching new products in short intervals is a critical factor for success to persist on the global market. At the same time many enterprises call for cost reduction in ...
Nadine Weber, Andreas Henrich
AAAI
2006
15 years 3 months ago
Tractable Classes of Metric Temporal Problems with Domain Rules
In this paper, we will deal with some important kinds of metric temporal reasoning problems that arise in many real-life situations. In particular, events X0, X1 . . . XN are mode...
T. K. Satish Kumar