Sciweavers

2531 search results - page 100 / 507
» Group testing in graphs
Sort
View
DAM
2006
100views more  DAM 2006»
15 years 4 months ago
A combinatorial algorithm for weighted stable sets in bipartite graphs
Abstract. Computing a maximum weighted stable set in a bipartite graph is considered wellsolved and usually approached with preflow-push, Ford-Fulkerson or network simplex algorith...
Ulrich Faigle, Gereon Frahling
CEC
2007
IEEE
15 years 10 months ago
Emergent specialization in the extended multi-rover problem
Abstract— This paper introduces the Collective Neuro Evolution (CONE) method, and compares its efficacy for designing specialization, with a conventional Neuro-Evolution (NE) me...
Geoff S. Nitschke, Martijn C. Schut, A. E. Eiben
GROUP
2003
ACM
15 years 9 months ago
Awareness support in a groupware widget toolkit
Group awareness is an important part of synchronous collaboration, and support for group awareness can greatly improve groupware usability. However, it is still difficult to build...
Jason Hill, Carl Gutwin
CAISE
2009
Springer
15 years 11 months ago
The Declarative Approach to Business Process Execution: An Empirical Test
Declarative approaches have been proposed to counter the limited flexibility of the traditional imperative modeling paradigm, but little empirical insights are available into thei...
Barbara Weber, Hajo A. Reijers, Stefan Zugal, Wern...
ICCS
2001
Springer
15 years 8 months ago
An Application of the Process Mechanism to a Room Allocation Problem Using the pCG Language
The Sisyphus-I initiative consists of a constraint satisfaction problem in which a group of people in a research environment must be allocated rooms. Numerous constraints are detai...
David Benn, Dan Corbett