Sciweavers

672 search results - page 46 / 135
» A General Solution to the Graph History Interaction Problem
Sort
View
CSR
2007
Springer
14 years 1 months ago
Maximal Intersection Queries in Randomized Graph Models
Consider a family of sets and a single set, called query set. How can one quickly find a member of the family which has a maximal intersection with the query set? Strict time cons...
Benjamin Hoffmann, Yury Lifshits, Dirk Nowotka
GPCE
2009
Springer
13 years 11 months ago
Mapping problem-space to solution-space features: a feature interaction approach
Mapping problem-space features into solution-space features is a fundamental configuration problem in software product line engineering. A configuration problem is defined as g...
Frans Sanen, Eddy Truyen, Wouter Joosen
JNW
2007
80views more  JNW 2007»
13 years 7 months ago
A New Method of Using Sensor Network for Solving Pursuit-Evasion Problem
— Wireless sensor networks offer the potential to significantly improve the performance of pursuers in pursuit-evasion games. In this paper, we study several sensor network syst...
Peng Zhuang, Yi Shang, Hongchi Shi
GECCO
2007
Springer
187views Optimization» more  GECCO 2007»
14 years 1 months ago
Defining implicit objective functions for design problems
In many design tasks it is difficult to explicitly define an objective function. This paper uses machine learning to derive an objective in a feature space based on selected examp...
Sean Hanna
PPOPP
2005
ACM
14 years 1 months ago
A linear-time algorithm for optimal barrier placement
We want to perform compile-time analysis of an SPMD program and place barriers in it to synchronize it correctly, minimizing the runtime cost of the synchronization. This is the b...
Alain Darte, Robert Schreiber