Sciweavers

11371 search results - page 1930 / 2275
» The network inhibition problem
Sort
View
SIGECOM
2003
ACM
122views ECommerce» more  SIGECOM 2003»
16 years 26 days ago
On polynomial-time preference elicitation with value queries
Preference elicitation — the process of asking queries to determine parties’ preferences — is a key part of many problems in electronic commerce. For example, a shopping age...
Martin Zinkevich, Avrim Blum, Tuomas Sandholm
AGP
2010
IEEE
16 years 21 days ago
Constraint Logic Programming
Constraint Logic Programming (CLP) is one of the most successful branches of Logic Programming; it attracts the interest of theoreticians and practitioners, and it is currently use...
Marco Gavanelli, Francesca Rossi
ASPDAC
2000
ACM
154views Hardware» more  ASPDAC 2000»
15 years 12 months ago
Dynamic weighting Monte Carlo for constrained floorplan designs in mixed signal application
Simulated annealing has been one of the most popular stochastic optimization methods used in the VLSI CAD field in the past two decades for handling NP-hard optimization problems...
Jason Cong, Tianming Kong, Faming Liang, Jun S. Li...
ANSS
1998
IEEE
15 years 12 months ago
An Adaptive Synchronization Protocol for Parallel Discrete Event Simulation
Simulation, especially discrete event simulation (DES), is used in a variety of disciplines where numerical methods are difficult or impossible to apply. One problem with this met...
Keith R. Bisset
ICCAD
1994
IEEE
131views Hardware» more  ICCAD 1994»
15 years 11 months ago
Edge-map: optimal performance driven technology mapping for iterative LUT based FPGA designs
We consider the problem of performance driven lookup-table (LUT) based technology mapping for FPGAs using a general delay model. In the general delay model, each interconnection e...
Hannah Honghua Yang, D. F. Wong
« Prev « First page 1930 / 2275 Last » Next »