Sciweavers

13603 search results - page 2667 / 2721
» On the Complexity of Computing Treelength
Sort
View
ATAL
2006
Springer
14 years 1 months ago
Winning back the CUP for distributed POMDPs: planning over continuous belief spaces
Distributed Partially Observable Markov Decision Problems (Distributed POMDPs) are evolving as a popular approach for modeling multiagent systems, and many different algorithms ha...
Pradeep Varakantham, Ranjit Nair, Milind Tambe, Ma...
DATE
2004
IEEE
119views Hardware» more  DATE 2004»
14 years 1 months ago
MINCE: Matching INstructions Using Combinational Equivalence for Extensible Processor
Designing custom-extensible instructions for Extensible Processors1 is a computationally complex task because of the large design space. The task of automatically matching candida...
Newton Cheung, Sri Parameswaran, Jörg Henkel,...
EMSOFT
2006
Springer
14 years 1 months ago
Incremental schedulability analysis of hierarchical real-time components
Embedded systems are complex as a whole but consist of smaller independent modules minimally interacting with each other. This structure makes embedded systems amenable to composi...
Arvind Easwaran, Insik Shin, Oleg Sokolsky, Insup ...
GECCO
2006
Springer
213views Optimization» more  GECCO 2006»
14 years 1 months ago
Evolutionary unit testing of object-oriented software using strongly-typed genetic programming
Evolutionary algorithms have successfully been applied to software testing. Not only approaches that search for numeric test data for procedural test objects have been investigate...
Stefan Wappler, Joachim Wegener
ICALP
2000
Springer
14 years 1 months ago
Scalable Secure Storage when Half the System Is Faulty
In this paper, we provide a method to safely store a document in perhaps the most challenging settings, a highly decentralized replicated storage system where up to half of the st...
Noga Alon, Haim Kaplan, Michael Krivelevich, Dahli...
« Prev « First page 2667 / 2721 Last » Next »