Sciweavers

636 search results - page 71 / 128
» Measuring Complexity of Intelligent Machines
Sort
View
LATA
2009
Springer
15 years 2 months ago
Nested Counters in Bit-Parallel String Matching
Many algorithms, e.g. in the field of string matching, are based on handling many counters, which can be performed in parallel, even on a sequential machine, using bit-parallelism...
Kimmo Fredriksson, Szymon Grabowski
INFOVIS
2000
IEEE
15 years 2 months ago
Interactive Problem Solving via Algorithm Visualization
COMIND is a tool for conceptual design of industrial products. It helps designers define and evaluate the initial design space by using search algorithms to generate sets of feasi...
Pearl Pu, Denis Lalanne
WSC
2008
15 years 3 days ago
Approximate dynamic programming: Lessons from the field
Approximate dynamic programming is emerging as a powerful tool for certain classes of multistage stochastic, dynamic problems that arise in operations research. It has been applie...
Warren B. Powell
ICMCS
2010
IEEE
211views Multimedia» more  ICMCS 2010»
14 years 11 months ago
Heterogenesis: Collectively emergent autonomy
Heterogenesis is an interactive sound and tactile installation consisting of a group of autonomous artificial agents that collectively generate and evolve a soundscape in response...
Carlos Castellanos, Diane Gromala, Philippe Pasqui...
CP
2003
Springer
15 years 3 months ago
A Synthesis of Constraint Satisfaction and Constraint Solving
Abstract. This paper offers a critique of the framework of Constraint Satisfaction Problems. While this framework has been successful in studying search techniques, and has inspire...
Michael J. Maher