Sciweavers

119 search results - page 12 / 24
» Complex Preferences for Answer Set Optimization
Sort
View
FPGA
2004
ACM
128views FPGA» more  FPGA 2004»
13 years 11 months ago
Incremental physical resynthesis for timing optimization
This paper presents a new approach to timing optimization for FPGA designs, namely incremental physical resynthesis, to answer the challenge of effectively integrating logic and p...
Peter Suaris, Lung-Tien Liu, Yuzheng Ding, Nan-Chi...
BROADNETS
2007
IEEE
14 years 2 months ago
Modeling and analysis of worm interactions (war of the worms)
—“War of the worms” is a war between opposing computer worms, creating complex worm interactions as well as detrimental impact on infrastructure. For example, in September 20...
Sapon Tanachaiwiwat, Ahmed Helmy
COMPGEOM
2010
ACM
14 years 28 days ago
Orthogonal range reporting: query lower bounds, optimal structures in 3-d, and higher-dimensional improvements
Orthogonal range reporting is the problem of storing a set of n points in d-dimensional space, such that the k points in an axis-orthogonal query box can be reported efficiently. ...
Peyman Afshani, Lars Arge, Kasper Dalgaard Larsen
AAMAS
2008
Springer
13 years 8 months ago
Logic-based automated multi-issue bilateral negotiation in peer-to-peer e-marketplaces
Abstract. We present a novel logic-based framework to automate multi-issue bilateral negotiation in e-commerce settings. The approach exploits logic as communication language among...
Azzurra Ragone, Tommaso Di Noia, Eugenio Di Sciasc...
CORR
2006
Springer
138views Education» more  CORR 2006»
13 years 8 months ago
Tight Bounds on the Complexity of Recognizing Odd-Ranked Elements
Let S = s1, s2, s3, ..., sn be a given vector of n distinct real numbers. The rank of z R with respect to S is defined as the number of elements si S such that si z. We consider...
Shripad Thite