Sciweavers

2412 search results - page 239 / 483
» Which Problems Have Strongly Exponential Complexity
Sort
View
CHI
2008
ACM
16 years 4 months ago
Expandable grids for visualizing and authoring computer security policies
We introduce the Expandable Grid, a novel interaction technique for creating, editing, and viewing many types of security policies. Security policies, such as file permissions pol...
Robert W. Reeder, Lujo Bauer, Lorrie Faith Cranor,...
SPATIALCOGNITION
2000
Springer
15 years 7 months ago
Interactive Layout Generation with a Diagrammatic Constraint Language
The paper analyzes a diagrammatic reasoning problem that consists in finding a graphical layout which simultaneously satisfies a set of constraints expressed in a formal language a...
Christoph Schlieder, Cornelius Hagen
DAC
2008
ACM
16 years 4 months ago
A progressive-ILP based routing algorithm for cross-referencing biochips
Due to recent advances in microfluidics technology, digital microfluidic biochips and their associated CAD problems have gained much attention, most of which has been devoted to d...
Ping-Hung Yuh, Sachin S. Sapatnekar, Chia-Lin Yang...
WEA
2010
Springer
241views Algorithms» more  WEA 2010»
15 years 10 months ago
A Branch-and-Price Algorithm for Multi-mode Resource Leveling
Resource leveling is a variant of resource-constrained project scheduling in which a non-regular objective function, the resource availability cost, is to be minimized. We present ...
Eamonn T. Coughlan, Marco E. Lübbecke, Jens S...
ISAAC
2007
Springer
100views Algorithms» more  ISAAC 2007»
15 years 10 months ago
Dynamic Distance Hereditary Graphs Using Split Decomposition
The problem of maintaining a representation of a dynamic graph as long as a certain property is satisfied has recently been considered for a number of properties. This paper prese...
Emeric Gioan, Christophe Paul