Sciweavers

1707 search results - page 260 / 342
» Early Integer Programming
Sort
View
AAAI
2007
15 years 6 days ago
Counting CSP Solutions Using Generalized XOR Constraints
We present a general framework for determining the number of solutions of constraint satisfaction problems (CSPs) with a high precision. Our first strategy uses additional binary...
Carla P. Gomes, Willem Jan van Hoeve, Ashish Sabha...
ASPDAC
2008
ACM
69views Hardware» more  ASPDAC 2008»
14 years 12 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
ASPDAC
2008
ACM
127views Hardware» more  ASPDAC 2008»
14 years 12 months ago
A multicycle communication architecture and synthesis flow for Global interconnect Resource Sharing
In deep submicron technology, wire delay is no longer negligible and is gradually dominating the system latency. Some state-of-the-art architectural synthesis flows adopt the distr...
Wei-Sheng Huang, Yu-Ru Hong, Juinn-Dar Huang, Ya-S...
ASPDAC
2008
ACM
86views Hardware» more  ASPDAC 2008»
14 years 12 months ago
An MILP-based wire spreading algorithm for PSM-aware layout modification
Phase shifting mask (PSM) is a promising resolution enhancement technique, which is used in the deep sub-wavelength lithography of the VLSI fabrication process. However, applying ...
Ming-Chao Tsai, Yung-Chia Lin, Ting-Chi Wang
ATAL
2008
Springer
14 years 12 months ago
Comparing winner determination algorithms for mixed multi-unit combinatorial auctions
Mixed multi-unit combinatorial auctions are combinatorial auctions in which the auctioneer and the bidders negotiate over transformations rather than over simple goods. By proposi...
Brammert Ottens, Ulle Endriss