4860 search results - page 493 / 972 » SNPs Problems, Complexity, and Algorithms |
125
click to vote
MICAI
2004
Springer
15 years 9 months ago
2004
Springer
A number of problems in computer science can be solved efficiently with the so called memory based or kernel methods. Among this problems (relevant to the AI community) are multime...
131
Voted
INFOCOM
2003
IEEE
15 years 9 months ago
2003
IEEE
— We investigate the problem of computing the types of the relationships between Internet Autonomous Systems. We refer to the model introduced in [1], [2] that bases the discover...
160
click to vote
ICPADS
1998
IEEE
15 years 8 months ago
1998
IEEE
The DAG-based task graph model has been found effective in scheduling for performance prediction and optimization of parallel applications. However the scheduling complexity and s...
146
click to vote
CINQ
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. Constrained graphs are directed graphs describing the control flow of processes models. In such graphs, nodes represent activities involved in the process, and edges the ...
116
click to vote
ECAI
2006
Springer
15 years 8 months ago
2006
Springer
Computer Supported Cooperative Work (CSCW) defines software tools and technology to support groups of people working together on a project, often at different sites [5]. In this wo...