Sciweavers

789 search results - page 27 / 158
» Solving Complex Problems Efficiently with Adaptive Automata
Sort
View
AIPS
2010
13 years 8 months ago
Incrementally Solving STNs by Enforcing Partial Path Consistency
Efficient management and propagation of temporal constraints is important for temporal planning as well as for scheduling. During plan development, new events and temporal constra...
Léon Planken, Mathijs de Weerdt, Neil Yorke...
JALC
2002
97views more  JALC 2002»
13 years 7 months ago
Semiring Frameworks and Algorithms for Shortest-Distance Problems
We define general algebraic frameworks for shortest-distance problems based on the structure of semirings. We give a generic algorithm for finding single-source shortest distances...
Mehryar Mohri
CORR
2008
Springer
108views Education» more  CORR 2008»
13 years 7 months ago
Efficient Isomorphism Testing for a Class of Group Extensions
Abstract. The group isomorphism problem asks whether two given groups are isomorphic or not. Whereas the case where both groups are abelian is well understood and can be solved eff...
François Le Gall
ICDAR
2005
IEEE
14 years 1 months ago
Text Extraction from Gray Scale Historical Document Images Using Adaptive Local Connectivity Map
This paper presents an algorithm using adaptive local connectivity map for retrieving text lines from the complex handwritten documents such as handwritten historical manuscripts....
Zhixin Shi, Srirangaraj Setlur, Venu Govindaraju
IAT
2008
IEEE
13 years 7 months ago
Scaling Up Multi-agent Reinforcement Learning in Complex Domains
TD-FALCON (Temporal Difference - Fusion Architecture for Learning, COgnition, and Navigation) is a class of self-organizing neural networks that incorporates Temporal Difference (...
Dan Xiao, Ah-Hwee Tan