Sciweavers

532 search results - page 6 / 107
» Tree exploration with advice
Sort
View
CASES
2008
ACM
13 years 9 months ago
Design space exploration for field programmable compressor trees
The Field Programmable Compressor Tree (FPCT) is a programmable compressor tree (e.g., a Wallace or Dadda Tree) intended for integration in an FPGA or other reconfigurable device....
Seyed Hosein Attarzadeh Niaki, Alessandro Cevrero,...
TALG
2011
98views more  TALG 2011»
13 years 2 months ago
Tree exploration with logarithmic memory
We consider the task of network exploration by a mobile agent (robot) with small memory. The agent has to traverse all nodes and edges of a network (represented as an undirected c...
Christoph Ambühl, Leszek Gasieniec, Andrzej P...
SIROCCO
2008
13 years 9 months ago
Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots
In the effort to understand the algorithmic limitations of computing by a swarm of robots, the research has focused on the minimal capabilities that allow a problem to be solved. ...
Paola Flocchini, David Ilcinkas, Andrzej Pelc, Nic...
ESTIMEDIA
2009
Springer
14 years 2 months ago
System-level MP-SoC design space exploration using tree visualization
— The complexity of today’s embedded systems forces designers to model and simulate systems and their components to explore the wide range of design choices. Such design space ...
Toktam Taghavi, Andy D. Pimentel, Mark Thompson
ICML
2004
IEEE
14 years 8 months ago
Parameter space exploration with Gaussian process trees
Computer experiments often require dense sweeps over input parameters to obtain a qualitative understanding of their response. Such sweeps can be prohibitively expensive, and are ...
Robert B. Gramacy, Herbert K. H. Lee, William G. M...