Sciweavers

2796 search results - page 338 / 560
» The coolest path problem
Sort
View
FPL
2006
Springer
96views Hardware» more  FPL 2006»
15 years 10 months ago
Reducing the Space Complexity of Pipelined Routing Using Modified Range Encoding
Interconnect delays are becoming an increasingly significant part of the critical path delay for circuits implemented in FPGAs. Pipelined interconnects have been proposed to addre...
Allan Carroll, Carl Ebeling
ICTAI
2000
IEEE
15 years 10 months ago
Building efficient partial plans using Markov decision processes
Markov Decision Processes (MDP) have been widely used as a framework for planning under uncertainty. They allow to compute optimal sequences of actions in order to achieve a given...
Pierre Laroche
IADIS
2004
15 years 8 months ago
Pattern definition to refine navigation structure in hypermedia/Web applications
When building Hypermedia/Web Applications, (different) designers are often faced with the same problems over and over again. Those recurring problems soon yield elegant solutions,...
Sven Casteleyn, Irene Garrigós, Peter Pless...
MASCOTS
2004
15 years 8 months ago
Reliable Response Delivery in Peer-to-Peer Systems
Unstructured peer-to-peer (P2P) system is the prevalent model in today's P2P system. In such systems, a response is sent along the same path that carried the incoming query m...
Xiaomei Liu, Yunhao Liu, Li Xiao
ACTA
2010
191views more  ACTA 2010»
15 years 6 months ago
Automata-based verification of programs with tree updates
This paper describes an effective verification procedure for imperative programs that handle (balanced) tree-like data structures. Since the verification problem considered is unde...
Peter Habermehl, Radu Iosif, Tomás Vojnar