2693 search results - page 143 / 539 » On Computing Complex Navigation Functions |
182
click to vote
ISORC
2003
IEEE
15 years 11 months ago
2003
IEEE
Many industrial real-time systems have evolved over a long period of time and were initially so simple that it was possible to predict consequences of adding new functionality by ...
202
click to vote
SODA
2012
ACM
13 years 8 months ago
2012
ACM
In this paper we prove lower bounds on randomized multiparty communication complexity, both in the blackboard model (where each message is written on a blackboard for all players ...
166
click to vote
QSHINE
2005
IEEE
16 years 19 hour ago
2005
IEEE
—We propose an adaptive hybrid automatic repeat request–forward error correction (ARQ–FEC) erasure-correcting scheme for quality of service (QoS)-driven mobile multicast serv...
180
click to vote
ACMICEC
2003
ACM
15 years 11 months ago
2003
ACM
The aggregation of conflicting preferences is a central problem in multiagent systems. The key difficulty is that the agents may report their preferences insincerely. Mechanism ...
167
click to vote
AI
2010
Springer
15 years 6 months ago
2010
Springer
We consider the problem of finding an unknown graph by using two types of queries with an additive property. Given a graph, an additive query asks the number of edges in a set of ...