Sciweavers

6274 search results - page 699 / 1255
» From query complexity to computational complexity
Sort
View
ATAL
2010
Springer
15 years 8 months ago
Path disruption games
We propose Path Disruption Games (PDGs), which consider collaboration between agents attempting stop an adversary from travelling from a source node to a target node in a graph. P...
Yoram Bachrach, Ely Porat
BMCBI
2007
203views more  BMCBI 2007»
15 years 7 months ago
A Grid-based solution for management and analysis of microarrays in distributed experiments
Several systems have been presented in the last years in order to manage the complexity of large microarray experiments. Although good results have been achieved, most systems ten...
Ivan Porro, Livia Torterolo, Luca Corradi, Marco F...
AIEDAM
2007
191views more  AIEDAM 2007»
15 years 7 months ago
Ontology-based design information extraction and retrieval
Because of the increasing complexity of products and the design process, as well as the popularity of computer-aided documentation tools, the number of electronic and textual desi...
Zhanjun Li, Karthik Ramani
BMCBI
2007
217views more  BMCBI 2007»
15 years 7 months ago
OntologyWidget - a reusable, embeddable widget for easily locating ontology terms
Background: Biomedical ontologies are being widely used to annotate biological data in a computer-accessible, consistent and well-defined manner. However, due to their size and co...
Catherine Beauheim, Farrell Wymore, Michael Nitzbe...
TALG
2010
86views more  TALG 2010»
15 years 5 months ago
Approximating corridors and tours via restriction and relaxation techniques
Given a rectangular boundary partitioned into rectangles, the Minimum-Length Corridor (MLC-R) problem consists of finding a corridor of least total length. A corridor is a set of ...
Arturo Gonzalez-Gutierrez, Teofilo F. Gonzalez