Sciweavers

2370 search results - page 361 / 474
» The Characterization of Data-Accumulating Algorithms
Sort
View
ESOP
1999
Springer
15 years 2 months ago
Dynamic Programming via Static Incrementalization
Abstract. Dynamicprogramming is an importantalgorithm design technique. It is used for solving problems whose solutions involve recursively solving subproblems that share subsubpro...
Yanhong A. Liu, Scott D. Stoller
GECCO
1999
Springer
133views Optimization» more  GECCO 1999»
15 years 2 months ago
Evolution of Goal-Directed Behavior from Limited Information in a Complex Environment
In this paper, we apply an evolutionary algorithm to learning behavior on a novel, interesting task to explore the general issue of learning e ective behaviors in a complex enviro...
Matthew R. Glickman, Katia P. Sycara
MICCAI
1999
Springer
15 years 2 months ago
Detection of Pulmonary Nodules on Ct and Volumetric Assessment of Change over Time
Abstract. We present a computer vision system that automatically detects pulmonary nodules in computed tomography (CT) scans of oncology patients, performs size analysis and assess...
Margrit Betke, Jane P. Ko
SIGMOD
1998
ACM
150views Database» more  SIGMOD 1998»
15 years 2 months ago
Extracting Schema from Semistructured Data
Semistructured data is characterized by the lack of any fixed and rigid schema, although typically the data hassomeimplicitstructure. While thelack offixedschemamakesextracting ...
Svetlozar Nestorov, Serge Abiteboul, Rajeev Motwan...
IEAAIE
1998
Springer
15 years 2 months ago
Generating Heuristics to Control Configuration Processes
Abstract. Configuration is the process of composing a system from a set of components such that the system fulfills a set of desired demands. The configuration process relies on a ...
Benno Stein