Sciweavers

3367 search results - page 208 / 674
» Incremental assignment problem
Sort
View
143
Voted
CP
2010
Springer
15 years 1 months ago
Towards Parallel Non Serial Dynamic Programming for Solving Hard Weighted CSP
We introduce a parallelized version of tree-decomposition based dynamic programming for solving difficult weighted CSP instances on many cores. A tree decomposition organizes cost ...
David Allouche, Simon de Givry, Thomas Schiex
164
Voted
CGO
2011
IEEE
14 years 7 months ago
Phase-based tuning for better utilization of performance-asymmetric multicore processors
—The latest trend towards performance asymmetry among cores on a single chip of a multicore processor is posing new challenges. For effective utilization of these performanceasym...
Tyler Sondag, Hridesh Rajan
115
Voted
SIGSOFT
2003
ACM
16 years 4 months ago
A strategy for efficiently verifying requirements
This paper describes a compositional proof strategy for verifying properties of requirements specifications. The proof strategy, which may be applied using either a model checker ...
Ralph D. Jeffords, Constance L. Heitmeyer
114
Voted
TISSEC
2002
123views more  TISSEC 2002»
15 years 3 months ago
An algebraic approach to IP traceback
We present a new solution to the problem of determining the path a packet traversed over the Internet (called the traceback problem) during a denial of service attack. Previous so...
Drew Dean, Matthew K. Franklin, Adam Stubblefield
142
Voted
AAAI
2006
15 years 5 months ago
Heuristic Search and Information Visualization Methods for School Redistricting
We describe an application of AI search and information visualization techniques to the problem of school redistricting, in which students are assigned to home schools within a co...
Marie desJardins, Blazej Bulka, Ryan Carr, Andrew ...