Sciweavers

893 search results - page 144 / 179
» P3C: A New Algorithm for the Simple Temporal Problem
Sort
View
BMCBI
2011
13 years 3 months ago
OrthoInspector: comprehensive orthology analysis and visual exploration
Background: The accurate determination of orthology and inparalogy relationships is essential for comparative sequence analysis, functional gene annotation and evolutionary studie...
Benjamin Linard, Julie D. Thompson, Olivier Poch, ...
AAAI
2010
13 years 10 months ago
Searching Without a Heuristic: Efficient Use of Abstraction
g Without a Heuristic: Efficient Use of Abstraction Bradford Larsen, Ethan Burns, Wheeler Ruml Department of Computer Science University of New Hampshire Durham, NH 03824 USA blars...
Bradford John Larsen, Ethan Burns, Wheeler Ruml, R...
ISPASS
2006
IEEE
14 years 2 months ago
Modeling TCAM power for next generation network devices
Applications in Computer Networks often require high throughput access to large data structures for lookup and classification. Many advanced algorithms exist to speed these searc...
Banit Agrawal, Timothy Sherwood
ATAL
2003
Springer
14 years 2 months ago
Trade of a problem-solving task
This paper focuses on a task allocation problem, particularly in cases where the task is to find a solution to a search problem or a constraint satisfaction problem. If the searc...
Shigeo Matsubara
WADS
2001
Springer
126views Algorithms» more  WADS 2001»
14 years 1 months ago
On External-Memory Planar Depth First Search
Even though a large number of I/O-efficient graph algorithms have been developed, a number of fundamental problems still remain open. For example, no space- and I/O-efficient algo...
Lars Arge, Ulrich Meyer, Laura Toma, Norbert Zeh