Sciweavers

3678 search results - page 29 / 736
» On the Stable Paths Problem
Sort
View
IJFCS
2007
93views more  IJFCS 2007»
13 years 9 months ago
On Computing Longest Paths in Small Graph Classes
The longest path problem is to find a longest path in a given graph. While the graph classes in which the Hamiltonian path problem can be solved efficiently are widely investigat...
Ryuhei Uehara, Yushi Uno
TOC
2008
95views more  TOC 2008»
13 years 9 months ago
On the LP Relaxation of the Asymmetric Traveling Salesman Path Problem
: This is a comment on the article "An O(logn) Approximation Ratio for the Asymmetric Traveling Salesman Path Problem" by C. Chekuri and M. P
Viswanath Nagarajan
CORR
1998
Springer
126views Education» more  CORR 1998»
13 years 9 months ago
Stable models and an alternative logic programming paradigm
In this paper we reexamine the place and role of stable model semantics in logic programming and contrast it with a least Herbrand model approach to Horn programs. We demonstrate ...
Victor W. Marek, Miroslaw Truszczynski
FSTTCS
2005
Springer
14 years 3 months ago
Monitoring Stable Properties in Dynamic Peer-to-Peer Distributed Systems
Monitoring a distributed system to detect a stable property is an important problem with many applications. The problem is especially challenging for a dynamic distributed system b...
Sathya Peri, Neeraj Mittal
ICNP
2009
IEEE
13 years 7 months ago
RASPberry: A Stable Reader Activation Scheduling Protocol in Multi-Reader RFID Systems
Abstract--Recent technological advances have motivated largescale deployment of RFID systems. RFID readers are often static and carefully deployed in a planned manner. However, the...
ShaoJie Tang, Jing Yuan, Xiang-Yang Li, Guihai Che...