Sciweavers

4313 search results - page 384 / 863
» Using time travel to diagnose computer problems
Sort
View
ECCC
2006
109views more  ECCC 2006»
15 years 7 months ago
How to rank with few errors: A PTAS for Weighted Feedback Arc Set on Tournaments
Suppose you ran a chess tournament, everybody played everybody, and you wanted to use the results to rank everybody. Unless you were really lucky, the results would not be acyclic...
Claire Kenyon-Mathieu, Warren Schudy
JMLR
2010
115views more  JMLR 2010»
15 years 2 months ago
Bayesian structure discovery in Bayesian networks with less space
Current exact algorithms for score-based structure discovery in Bayesian networks on n nodes run in time and space within a polynomial factor of 2n . For practical use, the space ...
Pekka Parviainen, Mikko Koivisto
CPHYSICS
2011
271views Education» more  CPHYSICS 2011»
14 years 11 months ago
A dedicated algorithm for calculating ground states for the triangular random bond Ising model
In the presented article we present an algorithm for the computation of ground state spin configurations for the 2d random bond Ising model on planar triangular lattice graphs. T...
O. Melchert, A. K. Hartmann
IPPS
1998
IEEE
15 years 12 months ago
Toward Embedded Development from Advanced Khoros
Current practice in the design of application software for high-performance embedded computing systems is characterized by long development times, lack of interoperability with ot...
Joe Fogler, Thomas Robey, Mark Young
SPAA
2009
ACM
16 years 2 months ago
Weak graph colorings: distributed algorithms and applications
We study deterministic, distributed algorithms for two weak variants of the standard graph coloring problem. We consider defective colorings, i.e., colorings where nodes of a colo...
Fabian Kuhn