Sciweavers

13621 search results - page 338 / 2725
» Computability and Complexity in Self-assembly
Sort
View
PKDD
2010
Springer
164views Data Mining» more  PKDD 2010»
15 years 4 months ago
Complexity Bounds for Batch Active Learning in Classification
Active learning [1] is a branch of Machine Learning in which the learning algorithm, instead of being directly provided with pairs of problem instances and their solutions (their l...
Philippe Rolet, Olivier Teytaud
AAMAS
2011
Springer
15 years 1 months ago
Manipulation complexity and gender neutrality in stable marriage procedures
The stable marriage problem is a well-known problem of matching men to women so that no man and woman who are not married to each other both prefer each other. Such a problem has a...
Maria Silvia Pini, Francesca Rossi, Kristen Brent ...
CORR
2011
Springer
192views Education» more  CORR 2011»
15 years 1 months ago
On cooperative patrolling: optimal trajectories, complexity analysis, and approximation algorithms
—The subject of this work is the patrolling of an environment with the aid of a team of autonomous agents. We consider both the design of open-loop trajectories with optimal prop...
Fabio Pasqualetti, Antonio Franchi, Francesco Bull...
PERCOM
2004
ACM
16 years 6 months ago
Models, Protocols, and Architectures for Secure Pervasive Computing: Challenges and Research Directions
We explore the challenges and research directions in building models, protocols and architectures to support security in pervasive computing environments. We argue that to be succ...
Roshan K. Thomas, Ravi S. Sandhu
COCOON
2005
Springer
16 years 9 days ago
Conserved Interval Distance Computation Between Non-trivial Genomes
Recently, several studies taking into account the ability for a gene to be absent or to have some copies in genomes have been proposed, as the examplar distance [11, 6] or the gene...
Guillaume Blin, Romeo Rizzi