Sciweavers

903 search results - page 130 / 181
» Completeness Results for Memory Logics
Sort
View
ATAL
2006
Springer
14 years 21 days ago
Verifying space and time requirements for resource-bounded agents
The effective reasoning capability of an agent can be defined as its capability to infer, within a given space and time bound, facts that are logical consequences of its knowledge...
Natasha Alechina, Mark Jago, Piergiorgio Bertoli, ...
ICDE
2006
IEEE
164views Database» more  ICDE 2006»
14 years 10 months ago
A Partition-Based Approach to Graph Mining
Existing graph mining algorithms typically assume that databases are relatively static and can fit into the main memory. Mining of subgraphs in a dynamic environment is currently ...
Junmei Wang, Wynne Hsu, Mong-Li Lee, Chang Sheng
EDBT
2008
ACM
103views Database» more  EDBT 2008»
14 years 9 months ago
A stratified approach to progressive approximate joins
Users often do not require a complete answer to their query but rather only a sample. They expect the sample to be either the largest possible or the most representative (or both)...
Wee Hyong Tok, Stéphane Bressan, Mong-Li Le...
ICCAD
2007
IEEE
87views Hardware» more  ICCAD 2007»
14 years 5 months ago
Optimal polynomial-time interprocedural register allocation for high-level synthesis and ASIP design
—Register allocation, in high-level synthesis and ASIP design, is the process of determining the number of registers to include in the resulting circuit or processor. The goal is...
Philip Brisk, Ajay K. Verma, Paolo Ienne
DATE
2009
IEEE
128views Hardware» more  DATE 2009»
14 years 3 months ago
A case study in distributed deployment of embedded software for camera networks
—We present an embedded software application for the real-time estimation of building occupancy using a network of video cameras. We analyze a series of alternative decomposition...
Francesco Leonardi, Alessandro Pinto, Luca P. Carl...