Sciweavers

19130 search results - page 412 / 3826
» Modelling multi-path problems
Sort
View
EVOW
2006
Springer
15 years 10 months ago
Improving Graph Colouring Algorithms and Heuristics Using a Novel Representation
Abstract. We introduce a novel representation for the graph colouring problem, called the Integer Merge Model, which aims to reduce the time complexity of an algorithm. Moreover, o...
István Juhos, Jano I. van Hemert
ACL
2003
15 years 8 months ago
Generalized Algorithms for Constructing Statistical Language Models
Recent text and speech processing applications such as speech mining raise new and more general problems related to the construction of language models. We present and describe in...
Cyril Allauzen, Mehryar Mohri, Brian Roark
CP
2010
Springer
15 years 5 months ago
Propagating the Bin Packing Constraint Using Linear Programming
The state-of-the-art global constraint for bin packing is due to Shaw. We compare two linear continuous relaxations of the bin packing problem, based on the DP-flow and Arc-flow ...
Hadrien Cambazard, Barry O'Sullivan
ICANN
2003
Springer
16 years 1 days ago
The Acquisition of New Categories through Grounded Symbols: An Extended Connectionist Model
Abstract. Solutions to the symbol grounding problem, in psychologically plausible cognitive models, have been based on hybrid connectionist/symbolic architectures, on robotic appro...
Alberto Greco, Thomas Riga, Angelo Cangelosi
BMCBI
2008
130views more  BMCBI 2008»
15 years 7 months ago
Function approximation approach to the inference of reduced NGnet models of genetic networks
Background: The inference of a genetic network is a problem in which mutual interactions among genes are deduced using time-series of gene expression patterns. While a number of m...
Shuhei Kimura, Katsuki Sonoda, Soichiro Yamane, Hi...