Sciweavers

989 search results - page 41 / 198
» Version spaces and the consistency problem
Sort
View
SWAT
1998
Springer
108views Algorithms» more  SWAT 1998»
14 years 1 months ago
Formal Language Constrained Path Problems
Given an alphabet , a (directed) graph G whose edges are weighted and -labeled, and a formal language L , the formal-language-constrained shortest/simple path problem consists of ...
Christopher L. Barrett, Riko Jacob, Madhav V. Mara...
CEC
2008
IEEE
13 years 11 months ago
Directed trees: A powerful representation for sorting and ordering problems
We present a simple framework for dealing with search spaces consisting of permutations. To demonstrate its usefulness, we build upon it a simple (1 + 1)-evolutionary algorithm fo...
Benjamin Doerr, Edda Happ
IEAAIE
2001
Springer
14 years 1 months ago
A Mixed Closure-CSP Method to Solve Scheduling Problems
Scheduling problems can be seen as a set of temporal metric and disjunctive constraints. So, they can be formulated in terms of CSPs techniques. In the literature, there are CSP-b...
María Isabel Alfonso Galipienso, Federico B...
MOC
2000
109views more  MOC 2000»
13 years 8 months ago
A posteriori error estimation and adaptivity for degenerate parabolic problems
Abstract. Two explicit error representation formulas are derived for degenerate parabolic PDEs, which are based on evaluating a parabolic residual in negative norms. The resulting ...
Ricardo H. Nochetto, Alfred Schmidt, C. Verdi
CORR
2011
Springer
188views Education» more  CORR 2011»
13 years 4 months ago
Information-Theoretic Viewpoints on Optimal Causal Coding-Decoding Problems
—In this paper we consider an interacting two-agent sequential decision-making problem consisting of a Markov source process, a causal encoder with feedback, and a causal decoder...
Siva K. Gorantla, Todd P. Coleman