Sciweavers

450 search results - page 39 / 90
» The Complexity of Computing Minimal Unidirectional Covering ...
Sort
View
EVOW
2005
Springer
15 years 5 months ago
Evolutionary Biclustering of Microarray Data
In this work, we address the biclustering of gene expression data with evolutionary computation, which has been proven to have excellent performance on complex problems. In express...
Jesús S. Aguilar-Ruiz, Federico Divina
APAL
2010
85views more  APAL 2010»
14 years 12 months ago
Elementary differences between the degrees of unsolvability and degrees of compressibility
Given two infinite binary sequences A, B we say that B can compress at least as well as A if the prefix-free Kolmogorov complexity relative to B of any binary string is at most as ...
George Barmpalias
AAAI
2006
15 years 1 months ago
Computing Slater Rankings Using Similarities among Candidates
Voting (or rank aggregation) is a general method for aggregating the preferences of multiple agents. One important voting rule is the Slater rule. It selects a ranking of the alte...
Vincent Conitzer
GI
2007
Springer
15 years 6 months ago
Industrial Requirements to Benefit from Test Automation Tools for GUI Testing
: In addition to the growing complexity of software systems, test effort takes increasing amounts of time and correspondingly more money. Testing costs may be reduced without compr...
Christof J. Budnik, Rajesh Subramanyan, Marlon Vie...
JELIA
2004
Springer
15 years 5 months ago
Hierarchical Decision Making by Autonomous Agents
Abstract. Often, decision making involves autonomous agents that are structured in a complex hierarchy, representing e.g. authority. Typically the agents share the same body of kno...
Stijn Heymans, Davy Van Nieuwenborgh, Dirk Vermeir