Sciweavers

197 search results - page 36 / 40
» Rough Set Approach to CBR
Sort
View
PODC
2009
ACM
14 years 8 months ago
Preventing versus curing: avoiding conflicts in transactional memories
Transactional memories are typically speculative and rely on contention managers to cure conflicts. This paper explores a complementary approach that prevents conflicts by schedul...
Aleksandar Dragojevic, Rachid Guerraoui, Anmol V. ...
IJCAI
1997
13 years 9 months ago
Reasoning about Concurrent Execution Prioritized Interrupts, and Exogenous Actions in the Situation Calculus
As an alternative to planning, an approach to highlevel agent control based on concurrent program execution is considered. A formal definition in the situation calculus of such a ...
Giuseppe De Giacomo, Yves Lespérance, Hecto...
BMCBI
2010
148views more  BMCBI 2010»
13 years 7 months ago
Applying unmixing to gene expression data for tumor phylogeny inference
Background: While in principle a seemingly infinite variety of combinations of mutations could result in tumor development, in practice it appears that most human cancers fall int...
Russell Schwartz, Stanley Shackney
RECOMB
2004
Springer
14 years 7 months ago
The evolutionary capacity of protein structures
In nature, one finds large collections of different protein sequences exhibiting roughly the same three-dimensional structure, and this observation underpins the study of structur...
Leonid Meyerguz, David Kempe, Jon M. Kleinberg, Ro...
ISAAC
2004
Springer
112views Algorithms» more  ISAAC 2004»
14 years 28 days ago
Dynamic Tree Cross Products
Abstract. Range searching over tree cross products – a variant of classic range searching – recently has been introduced by Buchsbaum et al. (Proc. 8th ESA, vol. 1879 of LNCS, ...
Marcus Raitner