Sciweavers

7597 search results - page 143 / 1520
» On the design of metric relations
Sort
View
SODA
2008
ACM
135views Algorithms» more  SODA 2008»
15 years 8 months ago
Improved algorithms for orienteering and related problems
In this paper we consider the orienteering problem in undirected and directed graphs and obtain improved approximation algorithms. The point to point-orienteering-problem is the f...
Chandra Chekuri, Nitish Korula, Martin Pál
AAI
2010
147views more  AAI 2010»
15 years 6 months ago
Maintaining engagement in Long-Term Interventions with Relational Agents
We discuss issues in designing virtual humans for applications which require long-term voluntary use, and the problem of maintaining engagement with users over time. Concepts and t...
Timothy W. Bickmore, Daniel Schulman, Langxuan Yin
TPDS
1998
71views more  TPDS 1998»
15 years 6 months ago
Parallel Algorithms for Relational Coarsest Partition Problems
—Relational Coarsest Partition Problems (RCPPs) play a vital role in verifying concurrent systems. It is known that RCPPs are 3-complete and hence it may not be possible to desig...
Sanguthevar Rajasekaran, Insup Lee
BIRTHDAY
2003
Springer
15 years 11 months ago
Fair Equivalence Relations
Equivalence between designs is a fundamental notion in verification. The linear and branching approaches to verification induce different notions of equivalence. When the designs...
Orna Kupferman, Nir Piterman, Moshe Y. Vardi
E2EMON
2006
IEEE
15 years 10 months ago
Object-Relational DBMS for Packet-Level Traffic Analysis: Case Study on Performance Optimization
Analyzing Internet traffic at packet level involves generally large amounts of raw data, derived data, and results from various analysis tasks. In addition, the analysis often proc...
Matti Siekkinen, Ernst W. Biersack, Vera Goebel