653 search results - page 23 / 131 » Factored Planning: How, When, and When Not |
175
click to vote
ECCC
2011
14 years 9 months ago
2011
Polynomial identity testing (PIT) problem is known to be challenging even for constant depth arithmetic circuits. In this work, we study the complexity of two special but natural ...
150
click to vote
BMCBI
2008
15 years 2 months ago
2008
Background: Availability of information about transcription factors (TFs) is crucial for genome biology, as TFs play a central role in the regulation of gene expression. While man...
138
click to vote
INFOCOM
2008
IEEE
15 years 8 months ago
2008
IEEE
— Load factor based congestion control schemes have shown to enhance network performance, in terms of utilization, packet loss and delay. In these schemes, using more accurate re...
112
click to vote
IUI
2006
ACM
15 years 7 months ago
2006
ACM
We are reaching a crisis with design of user interfaces for consumer electronics. Flashing 12:00 time indicators, push-andhold buttons, and interminable modes and menus are all sy...
149
Voted
FOCS
2006
IEEE
15 years 8 months ago
2006
IEEE
Combinatorial allocation problems require allocating items to players in a way that maximizes the total utility. Two such problems received attention recently, and were addressed ...