Sciweavers

2236 search results - page 442 / 448
» Language Independence and Language Tolerance in Logic Progra...
Sort
View
ALT
1995
Springer
15 years 1 months ago
Learning Unions of Tree Patterns Using Queries
This paper characterizes the polynomial time learnability of TPk, the class of collections of at most k rst-order terms. A collection in TPk de nes the union of the languages de n...
Hiroki Arimura, Hiroki Ishizaka, Takeshi Shinohara
JACM
2002
163views more  JACM 2002»
14 years 9 months ago
Formal verification of standards for distance vector routing protocols
We show how to use an interactive theorem prover, HOL, together with a model checker, SPIN, to prove key properties of distance vector routing protocols. We do three case studies: ...
Karthikeyan Bhargavan, Davor Obradovic, Carl A. Gu...
LCTRTS
2007
Springer
15 years 3 months ago
Integrated CPU and l2 cache voltage scaling using machine learning
Embedded systems serve an emerging and diverse set of applications. As a result, more computational and storage capabilities are added to accommodate ever more demanding applicati...
Nevine AbouGhazaleh, Alexandre Ferreira, Cosmin Ru...
SIGSOFT
2001
ACM
15 years 10 months ago
WREN---an environment for component-based development
Prior research in software environments focused on three important problems-- tool integration, artifact management, and process guidance. The context for that research, and hence...
Chris Lüer, David S. Rosenblum
ICALP
2009
Springer
15 years 9 months ago
Tight Bounds for the Cover Time of Multiple Random Walks
We study the cover time of multiple random walks. Given a graph G of n vertices, assume that k independent random walks start from the same vertex. The parameter of interest is the...
Robert Elsässer, Thomas Sauerwald