Sciweavers

1445 search results - page 110 / 289
» Uniformly Hard Languages
Sort
View
135
Voted
SIGMETRICS
2010
ACM
197views Hardware» more  SIGMETRICS 2010»
15 years 8 months ago
Coloring spatial point processes with applications to peer discovery in large wireless networks
In this paper, we study distributed channel assignment in wireless networks with applications to peer discovery in ad hoc wireless networks. We model channel assignment as a color...
Jian Ni, R. Srikant, Xinzhou Wu
COCO
2005
Springer
130views Algorithms» more  COCO 2005»
15 years 5 months ago
Pseudorandom Bits for Constant Depth Circuits with Few Arbitrary Symmetric Gates
We exhibit an explicitly computable ‘pseudorandom’ generator stretching l bits into m(l) = lΩ(log l) bits that look random to constant-depth circuits of size m(l) with log m...
Emanuele Viola
ICDE
2005
IEEE
194views Database» more  ICDE 2005»
16 years 5 months ago
Sentiment Mining in WebFountain
WebFountain is a platform for very large-scale text analytics applications that allows uniform access to a wide variety of sources. It enables the deployment of a variety of docum...
Jeonghee Yi, Wayne Niblack
213
Voted
ICLP
2009
Springer
16 years 4 months ago
On the Implementation of Weight Constraint Rules in Conflict-Driven ASP Solvers
Abstract. We present the first comprehensive approach to integrating cardinality and weight rules into conflict-driven ASP solving. We begin with a uniform, constraint-based charac...
Martin Gebser, Roland Kaminski, Benjamin Kaufmann,...
ICLP
2009
Springer
16 years 4 months ago
Logic Programming for Multiagent Planning with Negotiation
Multiagent planning deals with the problem of generating plans for multiple agents. It requires formalizing ways for the agents to interact and cooperate, in order to achieve their...
Tran Cao Son, Enrico Pontelli, Chiaki Sakama