Sciweavers

2446 search results - page 484 / 490
» Polyadic Concept Analysis
Sort
View
BMCBI
2002
126views more  BMCBI 2002»
13 years 8 months ago
RIO: Analyzing proteomes by automated phylogenomics using resampled inference of orthologs
Background: When analyzing protein sequences using sequence similarity searches, orthologous sequences (that diverged by speciation) are more reliable predictors of a new protein&...
Christian M. Zmasek, Sean R. Eddy
CSCW
2002
ACM
13 years 8 months ago
Physical and Virtual Tools: Activity Theory Applied to the Design of Groupware
Activity theory is based on the concept of tools mediating between subjects and objects. In this theory, an individual's creative interaction with his or her surroundings can ...
Morten Fjeld, Kristina Lauche, Martin Bichsel, Fre...
JAIR
2000
123views more  JAIR 2000»
13 years 8 months ago
Backbone Fragility and the Local Search Cost Peak
The local search algorithm WSat is one of the most successful algorithms for solving the satisfiability (SAT) problem. It is notably effective at solving hard Random 3-SAT instanc...
Josh Singer, Ian P. Gent, Alan Smaill
JUCS
2000
120views more  JUCS 2000»
13 years 8 months ago
Execution and Cache Performance of the Scheduled Dataflow Architecture
: This paper presents an evaluation of our Scheduled Dataflow (SDF) Processor. Recent focus in the field of new processor architectures is mainly on VLIW (e.g. IA-64), superscalar ...
Krishna M. Kavi, Joseph Arul, Roberto Giorgi
MST
2000
57views more  MST 2000»
13 years 8 months ago
On Scheduling Parallel Tasks at Twilight
We consider the problem of processing a given number of tasks on a given number of processors as quickly as possible when only vague information about the processing time of a task...
Hannah Bast