Sciweavers

889 search results - page 57 / 178
» General Conclusions
Sort
View
ALENEX
2001
151views Algorithms» more  ALENEX 2001»
15 years 1 months ago
The Asymmetric Traveling Salesman Problem: Algorithms, Instance Generators, and Tests
The purpose of this paper is to provide a preliminary report on the rst broad-based experimental comparison of modern heuristics for the asymmetric traveling salesmen problem ATSP....
Jill Cirasella, David S. Johnson, Lyle A. McGeoch,...
EVENT
2001
173views more  EVENT 2001»
15 years 1 months ago
Recognizing Action Events from Multiple Viewpoints
A first step towards an understanding of the semantic content in a video is the reliable detection and recognition of actions performed by objects. This is a dificult problem due ...
Tanveer Fathima Syeda-Mahmood, M. Alex O. Vasilesc...
USS
2004
15 years 1 months ago
On User Choice in Graphical Password Schemes
Graphical password schemes have been proposed as an alternative to text passwords in applications that support graphics and mouse or stylus entry. In this paper we detail what is,...
Darren Davis, Fabian Monrose, Michael K. Reiter
AAAI
2000
15 years 1 months ago
Redundancy in Random SAT Formulas
The random k-SAT model is extensively used to compare satisfiability algorithms or to find the best settings for the parameters of some algorithm. Conclusions are derived from the...
Yacine Boufkhad, Olivier Roussel
ICMAS
2000
15 years 1 months ago
The Computational Complexity of Agent Design Problems
This paper investigates the computational complexity of a fundamental problem in multi-agent systems: given an environment together with a specification of some task, can we const...
Michael Wooldridge