Sciweavers

1727 search results - page 207 / 346
» A Technique for Large Automated Mechanism Design Problems
Sort
View
IAT
2005
IEEE
16 years 1 days ago
An Approximate Pareto Optimal Cooperative Negotiation Model for Multiple
Cooperative negotiation is proved to be an effective paradigm to solve complex dynamic multi-objective problems in which each objective is associated to an agent. When the multi-o...
Nicola Gatti, Francesco Amigoni
ARCS
2006
Springer
15 years 10 months ago
Dynamic Dictionary-Based Data Compression for Level-1 Caches
Abstract. Data cache compression is actively studied as a venue to make better use of onchip transistors, increase apparent capacity of caches, and hide the long memory latencies. ...
Georgios Keramidas, Konstantinos Aisopos, Stefanos...
BMCBI
2007
146views more  BMCBI 2007»
15 years 6 months ago
Spatial location and its relevance for terminological inferences in bio-ontologies
Background: An adequate and expressive ontological representation of biological organisms and their parts requires formal reasoning mechanisms for their relations of physical aggr...
Stefan Schulz, Kornél G. Markó, Udo ...
ISCA
2007
IEEE
110views Hardware» more  ISCA 2007»
16 years 22 days ago
Late-binding: enabling unordered load-store queues
Conventional load/store queues (LSQs) are an impediment to both power-efficient execution in superscalar processors and scaling to large-window designs. In this paper, we propose...
Simha Sethumadhavan, Franziska Roesner, Joel S. Em...
ASPLOS
2012
ACM
14 years 2 months ago
A case for unlimited watchpoints
Numerous tools have been proposed to help developers fix software errors and inefficiencies. Widely-used techniques such as memory checking suffer from overheads that limit thei...
Joseph L. Greathouse, Hongyi Xin, Yixin Luo, Todd ...