Sciweavers

150 search results - page 10 / 30
» Solving Small TSPs with Constraints
Sort
View
ICTAI
2007
IEEE
14 years 1 months ago
Hypergraph Partitioning for Exploiting Localities in Nonlinear Constrained Optimization
In this paper, we present a new hypergraph partitioning algorithm that jointly optimizes the number of hyperedge cuts and the number of shared vertices in nonlinear constrained op...
Benjamin W. Wah, Soomin Lee
ASPDAC
2008
ACM
69views Hardware» more  ASPDAC 2008»
13 years 9 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
CONSTRAINTS
2007
100views more  CONSTRAINTS 2007»
13 years 7 months ago
Design of Financial CDO Squared Transactions Using Constraint Programming
We give an approximate and often extremely fast method of building a particular kind of portfolio in finance, here called a portfolio design (PD), with applications in the credit ...
Pierre Flener, Justin Pearson, Luis G. Reyna, Olof...
MOBIHOC
2005
ACM
14 years 7 months ago
Sextant: a unified node and event localization framework using non-convex constraints
Determining node and event locations is a canonical task for many wireless network applications. Yet dedicated infrastructure for determining position information is expensive, en...
Emin Gün Sirer, Rohan Murty, Saikat Guha
DCOSS
2006
Springer
13 years 11 months ago
Approximation Algorithms for Power-Aware Scheduling of Wireless Sensor Networks with Rate and Duty-Cycle Constraints
We develop algorithms for finding the minimum energy transmission schedule for duty-cycle and rate constrained wireless sensor nodes transmitting over an interference channel. Sinc...
Rajgopal Kannan, Shuangqing Wei