Sciweavers

153 search results - page 16 / 31
» Improved combination of online algorithms for acceptance and...
Sort
View
FOSSACS
2011
Springer
12 years 11 months ago
Minimizing Deterministic Lattice Automata
Traditional automata accept or reject their input, and are therefore Boolean. In contrast, weighted automata map each word to a value from a semiring over a large domain. The speci...
Shulamit Halamish, Orna Kupferman
ICCS
2004
Springer
14 years 1 months ago
On Balancing Delay and Cost for Routing Paths
Abstract. The distributed adaptive routing is the typical routing algorithm that is used in the current Internet. The path cost of the least delay (LD) path is relatively more expe...
Moonseong Kim, Young-Cheol Bang, Hyunseung Choo
CATE
2004
190views Education» more  CATE 2004»
13 years 9 months ago
Enhancing Online Learning Performance: An Application of Data Mining Methods
Recently web-based educational systems collect vast amounts of data on user patterns, and data mining methods can be applied to these databases to discover interesting associations...
Behrouz Minaei-Bidgoli, Gerd Kortemeyer, William F...
SEMWEB
2007
Springer
14 years 1 months ago
Solving Semantic Ambiguity to Improve Semantic Web based Ontology Matching
A new paradigm in Semantic Web research focuses on the development of a new generation of knowledge-based problem solvers, which can exploit the massive amounts of formally speciï¬...
Jorge Gracia, Vanessa Lopez, Mathieu d'Aquin, Mart...
CORR
2010
Springer
86views Education» more  CORR 2010»
13 years 8 months ago
Online Scheduling on Identical Machines using SRPT
Due to its optimality on a single machine for the problem of minimizing average flow time, ShortestRemaining-Processing-Time (SRPT) appears to be the most natural algorithm to con...
Kyle Fox, Benjamin Moseley