Sciweavers

566 search results - page 92 / 114
» Solution Reuse in Dynamic Constraint Satisfaction Problems
Sort
View
DSVIS
2003
Springer
15 years 5 months ago
Calligraphic Interfaces: Mixed Metaphors for Design
CAD systems have yet to become usable at the early stages of product ideation, where precise shape definitions and sometimes even design intentions are not fully developed. To over...
João Paulo Pereira, Joaquim A. Jorge, Vasco...
KDD
2008
ACM
115views Data Mining» more  KDD 2008»
16 years 23 days ago
Topical query decomposition
We introduce the problem of query decomposition, where we are given a query and a document retrieval system, and we want to produce a small set of queries whose union of resulting...
Francesco Bonchi, Carlos Castillo, Debora Donato, ...
P2P
2009
IEEE
115views Communications» more  P2P 2009»
15 years 7 months ago
An Approximation Algorithm for Minimum-Delay Peer-to-Peer Streaming
Peer-to-peer (P2P) technology provides a scalable solution in multimedia streaming. Many streaming applications, such as IPTV and video conferencing, have rigorous constraints on ...
Fei Huang, Binoy Ravindran, Anil Vullikanti
EOR
2006
70views more  EOR 2006»
15 years 11 days ago
Search allocation game
This paper deals with a multi-stage two-person zero-sum game called the multi-stage search allocation game (MSSAG), in which a searcher and an evader participate. The searcher dist...
Ryusuke Hohzaki
102
Voted
DAC
1997
ACM
15 years 4 months ago
Wire Segmenting for Improved Buffer Insertion
Buffer insertion seeks to place buffers on the wires of a signal net to minimize delay. Van Ginneken [14] proposed an optimal dynamic programming solution (with extensions propose...
Charles J. Alpert, Anirudh Devgan