Sciweavers

612 search results - page 53 / 123
» Hardness assumptions in the foundations of theoretical compu...
Sort
View
POPL
2008
ACM
14 years 8 months ago
Systems biology, models, and concurrency
Models will play a central role in the representation, storage, manipulation, and communication of knowledge in systems biology. Models capable of fulfilling such a role will like...
Walter Fontana
FOCS
2003
IEEE
14 years 1 months ago
Approximation Algorithms for Asymmetric TSP by Decomposing Directed Regular Multigraphs
A directed multigraph is said to be d-regular if the indegree and outdegree of every vertex is exactly d. By Hall’s theorem one can represent such a multigraph as a combination ...
Haim Kaplan, Moshe Lewenstein, Nira Shafrir, Maxim...
FOCS
1992
IEEE
13 years 12 months ago
Fault-tolerant Wait-free Shared Objects
Wait-free implementations of shared objects tolerate the failure of processes, but not the failure of base objects from which they are implemented. We consider the problem of imple...
Prasad Jayanti, Tushar Deepak Chandra, Sam Toueg
EXPCS
2007
13 years 11 months ago
The user in experimental computer systems research
Experimental computer systems research typically ignores the end-user, modeling him, if at all, in overly simple ways. We argue that this (1) results in inadequate performance eva...
Peter A. Dinda, Gokhan Memik, Robert P. Dick, Bin ...
FCT
2009
Springer
14 years 2 months ago
On Random Betweenness Constraints
Despite of their applicability betweennness constraints have (to the author’s knowledge) hardly been considered from the random structures point of view. They are essentially diï...
Andreas Goerdt