Sciweavers

169 search results - page 3 / 34
» Efficient search space exploration for HW-SW partitioning
Sort
View
AAAI
1996
13 years 6 months ago
Efficient Goal-Directed Exploration
If a state space is not completely known in advance, then search algorithms have to explore it sufficiently to locate a goal state and a path leading to it, performing therefore w...
Yury V. Smirnov, Sven Koenig, Manuela M. Veloso, R...
GPEM
2000
103views more  GPEM 2000»
13 years 5 months ago
Size Fair and Homologous Tree Crossovers for Tree Genetic Programming
Abstract. Size fair and homologous crossover genetic operators for tree based genetic programming are described and tested. Both produce considerably reduced increases in program s...
William B. Langdon
CODES
2001
IEEE
13 years 9 months ago
A design framework to efficiently explore energy-delay tradeoffs
Comprehensive exploration of the design space parameters at the system-level is a crucial task to evaluate architectural tradeoffs accounting for both energy and performance const...
William Fornaciari, Donatella Sciuto, Cristina Sil...
TOPNOC
2010
12 years 12 months ago
Search-Order Independent State Caching
Abstract. State caching is a memory reduction technique used by model checkers to alleviate the state explosion problem. It has traditionally been coupled with a depth-first search...
Sami Evangelista, Lars Michael Kristensen
PVLDB
2008
205views more  PVLDB 2008»
13 years 4 months ago
Making SENSE: socially enhanced search and exploration
Online communities like Flickr, del.icio.us and YouTube have established themselves as very popular and powerful services for publishing and searching contents, but also for ident...
Tom Crecelius, Mouna Kacimi, Sebastian Michel, Tho...