Sciweavers

2098 search results - page 60 / 420
» The Persistent Abstract Machine
Sort
View
135
Voted
MSCS
2010
104views more  MSCS 2010»
15 years 27 days ago
A note on accelerated Turing machines
ABSTRACT. In this note we prove that any Turing machine which uses only a finite computational space for every input cannot solve an uncomputable problem even in case it runs in a...
Cristian S. Calude, Ludwig Staiger
VLDB
1997
ACM
104views Database» more  VLDB 1997»
15 years 6 months ago
Integrating Reliable Memory in Databases
Abstract. Recent results in the Rio project at the University of Michigan show that it is possible to create an area of main memory that is as safe as disk from operating system cr...
Wee Teck Ng, Peter M. Chen
ICDCS
2010
IEEE
15 years 6 months ago
Guaranteeing BGP Stability with a Few Extra Paths
Abstract—Policy autonomy exercised by Autonomous Systems (ASes) on the Internet can result in persistent oscillations in Border Gateway Protocol, the Internet’s inter-domain ro...
Rachit Agarwal, Virajith Jalaparti, Matthew Caesar...
COMPGEOM
2008
ACM
15 years 4 months ago
Towards persistence-based reconstruction in euclidean spaces
Manifold reconstruction has been extensively studied for the last decade or so, especially in two and three dimensions. Recent advances in higher dimensions have led to new method...
Frédéric Chazal, Steve Oudot
GECCO
2010
Springer
173views Optimization» more  GECCO 2010»
15 years 2 months ago
Superstate identification for state machines using search-based clustering
State machines are a popular method of representing a syshigh level of abstraction that enables developers to gain an overview of the system they represent and quickly understand ...
Mathew Hall, Phil McMinn, Neil Walkinshaw