4110 search results - page 300 / 822 » Efficient algorithms for the 2-gathering problem |
194
click to vote
ASE
2005
15 years 6 months ago
2005
Techniques for efficiently evaluating future time Linear Temporal Logic (abbreviated LTL) formulae on finite execution traces are presented. While the standard models of LTL are i...
213
click to vote
ASIACRYPT
2010
Springer
15 years 4 months ago
2010
Springer
We consider the problem of encrypting structured data (e.g., a web graph or a social network) in such a way that it can be efficiently and privately queried. For this purpose, we ...
153
click to vote
ICC
2007
IEEE
15 years 10 months ago
2007
IEEE
The construction of good, finite-length, LDPC codes is currently an attractive research area. Reducing attention to the Binary Erasure Channel (BEC), this problem translates into t...
192
click to vote
CCIA
2008
Springer
15 years 8 months ago
2008
Springer
Meetings are an important vehicle for human interaction. The Meeting Scheduling problem (MS) considers several agents, each holding a personal calendar, and a number of meetings wh...
163
Voted
IJCAI
2003
15 years 8 months ago
2003
The aim of this paper is to provide a sound framework for addressing a difficult problem: the automatic construction of an autonomous agent's modular architecture. We briefly...