Sciweavers

828 search results - page 140 / 166
» Simplicial Powers of Graphs
Sort
View
ASPDAC
2008
ACM
93views Hardware» more  ASPDAC 2008»
13 years 9 months ago
Scheduling with integer time budgeting for low-power optimization
In this paper we present a mathematical programming formulation of the integer time budgeting problem for directed acyclic graphs. In particular, we formally prove that our constr...
Wei Jiang, Zhiru Zhang, Miodrag Potkonjak, Jason C...
ITP
2010
178views Mathematics» more  ITP 2010»
13 years 9 months ago
Interactive Termination Proofs Using Termination Cores
Recent advances in termination analysis have yielded new methods and tools that are highly automatic. However, when they fail, even experts have difficulty understanding why and de...
Panagiotis Manolios, Daron Vroon
ESWS
2008
Springer
13 years 9 months ago
Foundations of RDF Databases
The goal of this paper is to give an overview of the basics of the theory of RDF databases. We provide a formal definition of RDF that includes the features that distinguish this m...
Claudio Gutierrez
AAAI
2010
13 years 9 months ago
Dealing with Infinite Loops, Underestimation, and Overestimation of Depth-First Proof-Number Search
Depth-first proof-number search (df-pn) is powerful AND/OR tree search to solve positions in games. However, df-pn has a notorious problem of infinite loops when applied to domain...
Akihiro Kishimoto
IJCAI
2007
13 years 9 months ago
WiFi-SLAM Using Gaussian Process Latent Variable Models
WiFi localization, the task of determining the physical location of a mobile device from wireless signal strengths, has been shown to be an accurate method of indoor and outdoor l...
Brian Ferris, Dieter Fox, Neil D. Lawrence