Sciweavers

125 search results - page 7 / 25
» An Experimental Analysis of a Compact Graph Representation
Sort
View
ICDAR
2009
IEEE
13 years 5 months ago
Recurrent HMMs and Cursive Handwriting Recognition Graphs
Standard cursive handwriting recognition is based on a language model, mostly a lexicon of possible word hypotheses or character n-grams. The result is a list of word alternatives...
Marc-Peter Schambach
AIPS
2010
13 years 9 months ago
Temporal Planning with Problems Requiring Concurrency through Action Graphs and Local Search
We present an extension of the planning framework based on action graphs and local search to deal with PDDL2.1 temporal problems requiring concurrency, while previously the approa...
Alfonso Gerevini, Alessandro Saetti, Ivan Serina
GECCO
2008
Springer
115views Optimization» more  GECCO 2008»
13 years 8 months ago
A genetic programming approach to business process mining
The aim of process mining is to identify and extract process patterns from data logs to reconstruct an overall process flowchart. As business processes become more and more comple...
Chris J. Turner, Ashutosh Tiwari, Jörn Mehnen
AAAI
2008
13 years 9 months ago
Fast Planning by Search in Domain Transition Graph
Recent advances in classical planning have used the SAS+ formalism, and several effective heuristics have been developed based on the SAS+ formalism. Comparing to the traditional ...
Yixin Chen, Ruoyun Huang, Weixiong Zhang
ASPDAC
2006
ACM
91views Hardware» more  ASPDAC 2006»
14 years 1 months ago
Fast substrate noise-aware floorplanning with preference directed graph for mixed-signal SOCs
— In this paper, we introduce a novel substrate noise estimation technique during early floorplanning, based on the concept of Block Preference Directed Graph (BPDG) and the cla...
Minsik Cho, Hongjoong Shin, David Z. Pan