Sciweavers

749 search results - page 110 / 150
» Combinatory Models and Symbolic Computation
Sort
View
ENTCS
2006
161views more  ENTCS 2006»
14 years 10 months ago
Algebraic Specification and Coalgebraic Synthesis of Mealy Automata
We introduce the notion of functional stream derivative, generalising the notion of input derivative of rational expressions (Brzozowski 1964) to the case of stream functions over...
Jan J. M. M. Rutten
RECOMB
2006
Springer
15 years 10 months ago
Markov Additive Chains and Applications to Fragment Statistics for Peptide Mass Fingerprinting
Abstract. Peptide mass fingerprinting is a technique to identify a protein from its fragment masses obtained by mass spectrometry after enzymatic digestion. Recently, much attentio...
Hans-Michael Kaltenbach, Sebastian Böcker, Sv...
AI
2000
Springer
14 years 9 months ago
Stochastic dynamic programming with factored representations
Markov decisionprocesses(MDPs) haveproven to be popular models for decision-theoretic planning, but standard dynamic programming algorithms for solving MDPs rely on explicit, stat...
Craig Boutilier, Richard Dearden, Moisés Go...
AAAI
2007
15 years 7 days ago
Simple Robots with Minimal Sensing: From Local Visibility to Global Geometry
We consider problems of geometric exploration and selfdeployment for simple robots that can only sense the combinatorial (non-metric) features of their surroundings. Even with suc...
Subhash Suri, Elias Vicari, Peter Widmayer
STOC
2006
ACM
166views Algorithms» more  STOC 2006»
15 years 10 months ago
New upper and lower bounds for randomized and quantum local search
Local Search problem, which finds a local minimum of a black-box function on a given graph, is of both practical and theoretical importance to combinatorial optimization, complexi...
Shengyu Zhang