Sciweavers

16160 search results - page 3143 / 3232
» How to approach humans
Sort
View
SIGECOM
2003
ACM
141views ECommerce» more  SIGECOM 2003»
14 years 1 months ago
Automated mechanism design for a self-interested designer
Often, an outcome must be chosen on the basis of the preferences reported by a group of agents. The key difficulty is that the agents may report their preferences insincerely to m...
Vincent Conitzer, Tuomas Sandholm
ATAL
2003
Springer
14 years 1 months ago
Capturing agent autonomy in roles and XML
A key question in the field of agent-oriented software engineering is how the kind and extent of autonomy owned by computational agents can be appropriately captured. As long as ...
Gerhard Weiß, Michael Rovatsos, Matthias Nic...
FPGA
2003
ACM
156views FPGA» more  FPGA 2003»
14 years 1 months ago
Architectures and algorithms for synthesizable embedded programmable logic cores
As integrated circuits become more and more complex, the ability to make post-fabrication changes will become more and more attractive. This ability can be realized using programm...
Noha Kafafi, Kimberly Bozman, Steven J. E. Wilton
ICALP
2003
Springer
14 years 1 months ago
Anycasting in Adversarial Systems: Routing and Admission Control
Abstract. In this paper we consider the problem of routing packets in dynamically changing networks, using the anycast mode. In anycasting, a packet may have a set of destinations ...
Baruch Awerbuch, André Brinkmann, Christian...
ICALP
2003
Springer
14 years 1 months ago
Fixed-Parameter Algorithms for the (k, r)-Center in Planar Graphs and Map Graphs
The (k, r)-center problem asks whether an input graph G has ≤ k vertices (called centers) such that every vertex of G is within distance ≤ r from some center. In this paper we ...
Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Ha...
« Prev « First page 3143 / 3232 Last » Next »