Sciweavers

284 search results - page 47 / 57
» What Matchings Can Be Stable
Sort
View
JACM
2006
134views more  JACM 2006»
13 years 9 months ago
Online algorithms for market clearing
In this article, we study the problem of online market clearing where there is one commodity in the market being bought and sold by multiple buyers and sellers whose bids arrive an...
Avrim Blum, Tuomas Sandholm, Martin Zinkevich
MTA
2007
141views more  MTA 2007»
13 years 9 months ago
Flexible integration of multimedia sub-queries with qualitative preferences
Complex multimedia queries, aiming to retrieve from large databases those objects that best match the query specification, are usually processed by splitting them into a set of m ...
Ilaria Bartolini, Paolo Ciaccia, Vincent Oria, M. ...
MICRO
2009
IEEE
326views Hardware» more  MICRO 2009»
14 years 4 months ago
DDT: design and evaluation of a dynamic program analysis for optimizing data structure usage
Data structures define how values being computed are stored and accessed within programs. By recognizing what data structures are being used in an application, tools can make app...
Changhee Jung, Nathan Clark
ACMACE
2005
ACM
14 years 3 months ago
Possession techniques for interaction in real-time strategy augmented reality games
There have been a number of interactive games created for Augmented Reality (AR) environments. In this paper, interaction techniques to support Real-Time Strategy (RTS) games in A...
Keith Phillips, Wayne Piekarski
AGENTS
1997
Springer
14 years 1 months ago
A Scalable Comparison-Shopping Agent for the World-Wide Web
The World-Wide-Web is less agent-friendly than we might hope. Most information on the Web is presented in loosely structured natural language text with no agent-readable semantics...
Robert B. Doorenbos, Oren Etzioni, Daniel S. Weld