3600 search results - page 186 / 720 » The settling-time reducibility ordering |
163
click to vote
CP
2009
Springer
15 years 4 months ago
2009
Springer
We describe a new exact solver for the minimization of open stacks problem (MOSP). By combining nogood recording with a branch and bound strategy based on choosing which customer s...
355
click to vote
GECCO
2011
Springer
14 years 10 months ago
2011
Springer
The generalized traveling salesman problem (GTSP) is an NPhard problem that extends the classical traveling salesman problem by partitioning the nodes into clusters and looking fo...
183
click to vote
JIPS
2006
15 years 6 months ago
2006
In this paper, we proposed a MAC protocol, which can dynamically adjust Listening/Sleeping time rate of wireless sensor nodes according to data traffic load. In sensor networks, se...
190
click to vote
CCS
2011
ACM
14 years 6 months ago
2011
ACM
We present the design, implementation and evaluation of an algorithm that checks audit logs for compliance with privacy and security policies. The algorithm, which we name reduce,...
185
click to vote
TCSV
2008
15 years 6 months ago
2008
Abstract--In contrast to the macroblock-based in-loop deblocking filters, the filters of VC-1 perform all horizontal edges (for in-loop filtering) or vertical edges (for overlap sm...