Sciweavers

26354 search results - page 252 / 5271
» How we refactor, and how we know it
Sort
View
AAMAS
2007
Springer
16 years 26 days ago
Networks of Learning Automata and Limiting Games
Learning Automata (LA) were recently shown to be valuable tools for designing Multi-Agent Reinforcement Learning algorithms. One of the principal contributions of LA theory is that...
Peter Vrancx, Katja Verbeeck, Ann Nowé
AINTEC
2007
Springer
16 years 26 days ago
Gap Analysis in IP Multicast Dissemination
Abstract. IP multicast is advantageous for high quality streaming applications and future needs in the Internet. However, it is generally recognized that IP multicast requires sign...
Hitoshi Asaeda, Bill Manning
COCO
2007
Springer
93views Algorithms» more  COCO 2007»
16 years 25 days ago
S-T Connectivity on Digraphs with a Known Stationary Distribution
We present a deterministic logspace algorithm for solving S-T Connectivity on directed graphs if (i) we are given a stationary distribution of the random walk on the graph in whic...
Kai-Min Chung, Omer Reingold, Salil P. Vadhan
IPPS
2006
IEEE
16 years 21 days ago
Web server protection by customized instruction set encoding
We present a novel technique to secure the execution of a processor against the execution of malicious code (trojans, viruses). The main idea is to permute parts of the opcode val...
Bernhard Fechner, Jörg Keller, Andreas Wohlfe...
LICS
2005
IEEE
16 years 7 days ago
A Polynomial Time Presburger Criterion and Synthesis for Number Decision Diagrams
Number Decision Diagrams (NDD) are the automatabased symbolic representation for manipulating sets of integer vectors encoded as strings of digit vectors (least or most significa...
Jérôme Leroux