Sciweavers

97 search results - page 14 / 20
» Separating systems and oriented graphs of diameter two
Sort
View
RTA
2011
Springer
12 years 10 months ago
Modular Termination Proofs of Recursive Java Bytecode Programs by Term Rewriting
In [5, 15] we presented an approach to prove termination of non-recursive Java Bytecode (JBC) programs automatically. Here, JBC programs are first transformed to finite terminat...
Marc Brockschmidt, Carsten Otto, Jürgen Giesl
TKDE
2010
160views more  TKDE 2010»
13 years 5 months ago
Using Proximity Search to Estimate Authority Flow
—Authority flow and proximity search have been used extensively in measuring the association between entities in data graphs, ranging from the Web to relational and XML database...
Vagelis Hristidis, Yannis Papakonstantinou, Ramakr...
FUIN
2007
135views more  FUIN 2007»
13 years 7 months ago
On First-Order Fragments for Mazurkiewicz Traces
Mazurkiewicz traces form a model for concurrency. Temporal logic st-order logic are important tools in order to deal with the abstract behavior of such systems. Since typical prop...
Volker Diekert, Martin Horsch, Manfred Kufleitner
IDEAL
2003
Springer
14 years 17 days ago
Agent Compromises in Distributed Problem Solving
ERA is a multi-agent oriented method for solving constraint satisfaction problems [5]. In this method, agents make decisions based on the information obtained from their environmen...
Yi Tang, Jiming Liu, Xiaolong Jin
TABLETOP
2007
IEEE
14 years 1 months ago
Ortholumen: Using Light for Direct Tabletop Input
Ortholumen is a light pen based tabletop interaction system that can employ all the pen’s spatial degrees of freedom (DOF). The pen’s light is projected from above onto a hori...
Tommaso Piazza, Morten Fjeld