Sciweavers

400 search results - page 39 / 80
» What Makes a Problem GP-Hard
Sort
View
TLDI
2009
ACM
169views Formal Methods» more  TLDI 2009»
16 years 1 months ago
Relational parametricity for references and recursive types
We present a possible world semantics for a call-by-value higherorder programming language with impredicative polymorphism, general references, and recursive types. The model is o...
Lars Birkedal, Kristian Støvring, Jacob Tha...
IAT
2007
IEEE
15 years 10 months ago
Privacy Loss in Classical Multiagent Planning
Privacy is often cited as the main reason to adopt a multiagent approach for a certain problem. This also holds true for multiagent planning. Still, papers on multiagent planning ...
Roman van der Krogt
VISUALIZATION
2005
IEEE
15 years 10 months ago
The Value of Visualization
The field of Visualization is getting mature. Many problems have been solved, and new directions are sought for. In order to make good choices, an understanding of the purpose an...
Jarke J. van Wijk
INFOCOM
2003
IEEE
15 years 9 months ago
Time-Optimal Network Queue Control: The Case of a Single Congested Node
-We solve the problem of time-optimal network queue control: what are the input data rates that make network queue sizes converge to their ideal size in the least possible time aft...
Mahadevan Iyer, Wei Kang Tsai
MOBICOM
1997
ACM
15 years 8 months ago
Log-Time Algorithms for Scheduling Single and Multiple Channel Data Broadcast
With the increasing popularity of portable wireless computers, mechanisms to efficiently transmit information to such clients are of significant interest. The environmentundercons...
Sohail Hameed, Nitin H. Vaidya