Sciweavers

881 search results - page 99 / 177
» Solving satisfiability problems with preferences
Sort
View
ASPDAC
2008
ACM
69views Hardware» more  ASPDAC 2008»
13 years 9 months ago
Fast, quasi-optimal, and pipelined instruction-set extensions
Nowadays many customised embedded processors offer the possibility of speeding up an application by implementing it using Application-Specific Functional units (AFUs). However, th...
Ajay K. Verma, Philip Brisk, Paolo Ienne
CAD
2006
Springer
13 years 7 months ago
Field modeling with sampled distances
Traditional mesh-based approaches to the modeling and analysis of physical fields within geometric models require some form of topological reconstruction and conversion in the mes...
Michael Freytag, Vadim Shapiro, Igor G. Tsukanov
ATAL
2010
Springer
13 years 8 months ago
Optimal temporal decoupling in multiagent systems
When agents need to interact in order to solve some (possibly common) problem, resolving potential conflicts beforehand is often preferred to coordination during execution. Agents...
Léon Planken, Mathijs de Weerdt, Cees Witte...
AMEC
2004
Springer
14 years 1 months ago
Designing Auctions for Deliberative Agents
Abstract. In many settings, bidding agents for auctions do not know their preferences a priori. Instead, they must actively determine them through deliberation (e.g., information p...
Kate Larson, Tuomas Sandholm
IPM
2007
85views more  IPM 2007»
13 years 7 months ago
A retrospective study of a hybrid document-context based retrieval model
This paper describes our novel retrieval model that is based on contexts of query terms in documents (i.e., document contexts). Our model is novel because it explicitly takes into...
Ho Chung Wu, Robert W. P. Luk, Kam-Fai Wong, K. L....