Sciweavers

3204 search results - page 601 / 641
» The Alcuin Number of a Graph
Sort
View
BMCBI
2006
147views more  BMCBI 2006»
14 years 10 months ago
Grouping Gene Ontology terms to improve the assessment of gene set enrichment in microarray data
Background: Gene Ontology (GO) terms are often used to assess the results of microarray experiments. The most common way to do this is to perform Fisher's exact tests to find...
Alex Lewin, Ian C. Grieve
ECCC
2006
145views more  ECCC 2006»
14 years 10 months ago
Constraint satisfaction: a personal perspective
Attempts at classifying computational problems as polynomial time solvable, NP-complete, or belonging to a higher level in the polynomial hierarchy, face the difficulty of undecid...
Tomás Feder
CORR
2007
Springer
132views Education» more  CORR 2007»
14 years 10 months ago
On Compact Routing for the Internet
The Internet’s routing system is facing stresses due to its poor fundamental scaling properties. Compact routing is a research field that studies fundamental limits of routing ...
Dmitri V. Krioukov, Kimberly C. Claffy, Kevin R. F...
JAIR
2006
90views more  JAIR 2006»
14 years 10 months ago
Engineering Benchmarks for Planning: the Domains Used in the Deterministic Part of IPC-4
In a field of research about general reasoning mechanisms, it is essential to have appropriate benchmarks. Ideally, the benchmarks should reflect possible applications of the deve...
Jörg Hoffmann, Stefan Edelkamp, Sylvie Thi&ea...
IJAC
2007
116views more  IJAC 2007»
14 years 10 months ago
On the Complexity of the Whitehead Minimization Problem
The Whitehead minimization problem consists in finding a minimum size element in the automorphic orbit of a word, a cyclic word or a finitely generated subgroup in a finite rank...
Abdó Roig, Enric Ventura, Pascal Weil