Sciweavers

15614 search results - page 3121 / 3123
» The State of State
Sort
View
STACS
2007
Springer
13 years 12 months ago
Reachability in Unions of Commutative Rewriting Systems Is Decidable
We consider commutative string rewriting systems (Vector Addition Systems, Petri nets), i.e., string rewriting systems in which all pairs of letters commute. We are interested in r...
Mikolaj Bojanczyk, Piotr Hoffman
SIGUCCS
2006
ACM
13 years 11 months ago
Better results in mathematics lessons with a virtual personal teacher
In this paper we present the results of an experiment made with our e-librarian service ”MatES”, an e-Learning tool on fractions in mathematics. MatES allows students to enter...
Serge Linckels, Carole Dording, Christoph Meinel
ISCA
2005
IEEE
101views Hardware» more  ISCA 2005»
13 years 11 months ago
Near-Optimal Worst-Case Throughput Routing for Two-Dimensional Mesh Networks
Minimizing latency and maximizing throughput are important goals in the design of routing algorithms for interconnection networks. Ideally, we would like a routing algorithm to (a...
Daeho Seo, Akif Ali, Won-Taek Lim, Nauman Rafique,...
GECCO
2003
Springer
201views Optimization» more  GECCO 2003»
13 years 11 months ago
Solving Mastermind Using Genetic Algorithms
The MasterMind game involves decoding a secret code. The classic game is a code of six possible colors in four slots. The game has been analyzed and optimal strategies have been po...
Tom Kalisker, Doug Camens
SIGIR
1997
ACM
13 years 10 months ago
Learning Routing Queries in a Query Zone
Word usage is domain dependent. A common word in one domain can be quite infrequent in another. In this study we exploit this property of word usage to improve document routing. W...
Amit Singhal, Mandar Mitra, Chris Buckley
« Prev « First page 3121 / 3123 Last » Next »