Sciweavers

8647 search results - page 1467 / 1730
» The Container Selection Problem
Sort
View
ATAL
2006
Springer
15 years 11 months ago
Learning the required number of agents for complex tasks
Coordinating agents in a complex environment is a hard problem, but it can become even harder when certain characteristics of the tasks, like the required number of agents, are un...
Sébastien Paquet, Brahim Chaib-draa
CSB
2004
IEEE
149views Bioinformatics» more  CSB 2004»
15 years 11 months ago
Weighting Features to Recognize 3D Patterns of Electron Density in X-Ray Protein Crystallography
Feature selection and weighting are central problems in pattern recognition and instance-based learning. In this work, we discuss the challenges of constructing and weighting feat...
Kreshna Gopal, Tod D. Romo, James C. Sacchettini, ...
CAAN
2006
Springer
15 years 11 months ago
Distributed Routing in Tree Networks with Few Landmarks
We consider the problem of finding a short path between any two nodes of a network when no global information is available, nor any oracle to help in routing. A mobile agent, situa...
Ioannis Z. Emiris, Euripides Markou, Aris Pagourtz...
CCS
2006
ACM
15 years 11 months ago
Searchable symmetric encryption: improved definitions and efficient constructions
Searchable symmetric encryption (SSE) allows a party to outsource the storage of his data to another party in a private manner, while maintaining the ability to selectively search...
Reza Curtmola, Juan A. Garay, Seny Kamara, Rafail ...
EDOC
2004
IEEE
15 years 11 months ago
Security Patterns: A Method for Constructing Secure and Efficient Inter-Company Coordination Systems
As the Internet, intranets and other wide-area open networks grow, novel techniques for building distributed systems, notably mobile agents, are attracting increasing attention. T...
Nobukazu Yoshioka, Shinichi Honiden, Anthony Finke...
« Prev « First page 1467 / 1730 Last » Next »