Sciweavers

3653 search results - page 558 / 731
» On Recognizable Timed Languages
Sort
View
CP
2009
Springer
16 years 28 days ago
Why Cumulative Decomposition Is Not as Bad as It Sounds
Abstract. The global cumulative constraint was proposed for modelling cumulative resources in scheduling problems for finite domain (FD) propagation. Since that time a great deal ...
Andreas Schutt, Thibaut Feydy, Peter J. Stuckey, M...
ICALP
2009
Springer
16 years 28 days ago
Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness
Abstract Randomized rumor spreading is an efficient protocol to distribute information in networks. Recently, a quasirandom version has been proposed and proven to work equally we...
Benjamin Doerr, Tobias Friedrich, Thomas Sauerwald
ICALP
2009
Springer
16 years 27 days ago
Qualitative Concurrent Stochastic Games with Imperfect Information
Abstract. We study a model of games that combines concurrency, imperfect information and stochastic aspects. Those are finite states games in which, at each round, the two players...
Vincent Gripon, Olivier Serre
ICLP
2009
Springer
16 years 27 days ago
An Engine for Computing Well-Founded Models
The seemingly simple choice of whether to use call variance or call subsumption in a tabled evaluation deeply affects an evaluation’s properties. Most tabling implementations hav...
Terrance Swift
ICASSP
2009
IEEE
16 years 26 days ago
Automatic pronunciation verification of english letter-names for early literacy assessment of preliterate children
Children need to master reading letter-names and lettersounds before reading phrases and sentences. Pronunciation assessment of letter-names and letter-sounds read aloud is an imp...
Matthew Black, Joseph Tepperman, Abe Kazemzadeh, S...