Sciweavers

10493 search results - page 7 / 2099
» Dynamic Word Problems
Sort
View
MFCS
2010
Springer
13 years 6 months ago
Robust Computations with Dynamical Systems
Abstract. In this paper we discuss the computational power of Lipschitz dynamical systems which are robust to infinitesimal perturbations. Whereas the study in [1] was done only f...
Olivier Bournez, Daniel S. Graça, Emmanuel ...
LREC
2008
146views Education» more  LREC 2008»
13 years 9 months ago
A Contextual Dynamic Network Model for WSD Using Associative Concept Dictionary
Many of the Japanese ideographs (Chinese characters) have a few meanings. Such ambiguities should be identified by using their contextual information. For example, we have an ideo...
Jun Okamoto, Kiyoko Uchiyama, Shun Ishizaki
SLS
2009
Springer
274views Algorithms» more  SLS 2009»
14 years 7 days ago
A Memetic Algorithm for the Multidimensional Assignment Problem
The Multidimensional Assignment Problem (MAP or s-AP in the case of s dimensions) is an extension of the well-known assignment problem. The most studied case of MAP is 3-AP, though...
Gregory Gutin, Daniel Karapetyan
FGCS
2006
57views more  FGCS 2006»
13 years 7 months ago
On a solvability of contact problems with visco-plastic friction in the thermo-visco-plastic Bingham rheology
This paper deals with the solvability of contact problems with a local visco-plastic friction in the thermo-visco-plastic Bingham rheology. The generalized case of bodies of arbit...
Jirí Nedoma
IANDC
2006
86views more  IANDC 2006»
13 years 7 months ago
Table design in dynamic programming
Dynamic Programming solves combinatorial optimization problems by recursive decomposition and tabulation of intermediate results. The first step in the design of a dynamic program...
Peter Steffen, Robert Giegerich