Sciweavers

5622 search results - page 146 / 1125
» Solving architectural modelling problems using knowledge
Sort
View
AIMSA
2008
Springer
15 years 8 months ago
DynABT: Dynamic Asynchronous Backtracking for Dynamic DisCSPs
Abstract. Constraint Satisfaction has been widely used to model static combinatorial problems. However, many AI problems are dynamic and take place in a distributed environment, i....
Bayo Omomowo, Inés Arana, Hatem Ahriz
ICDAR
2009
IEEE
15 years 4 months ago
Learning on the Fly: Font-Free Approaches to Difficult OCR Problems
Despite ubiquitous claims that optical character recognition (OCR) is a "solved problem," many categories of documents continue to break modern OCR software such as docu...
Andrew Kae, Erik G. Learned-Miller
GECCO
2007
Springer
177views Optimization» more  GECCO 2007»
16 years 16 days ago
Evolving problem heuristics with on-line ACGP
Genetic Programming uses trees to represent chromosomes. The user defines the representation space by defining the set of functions and terminals to label the nodes in the trees. ...
Cezary Z. Janikow
CHB
2011
93views more  CHB 2011»
14 years 10 months ago
Web Wisdom: An essay on how Web 2.0 and Semantic Web can foster a global knowledge society
Admittedly this is a presumptuous title that should never be used when reporting on individual research advances. Wisdom is just not a scientific concept. In this case, though, w...
Christopher Thomas, Amit P. Sheth
GECCO
2006
Springer
200views Optimization» more  GECCO 2006»
15 years 10 months ago
A new approach for shortest path routing problem by random key-based GA
In this paper, we propose a Genetic Algorithm (GA) approach using a new paths growth procedure by the random key-based encoding for solving Shortest Path Routing (SPR) problem. An...
Mitsuo Gen, Lin Lin