Sciweavers

413 search results - page 17 / 83
» Computing and Exploiting Tree-Decompositions for Solving Con...
Sort
View
COMPULOG
1999
Springer
15 years 5 months ago
Dynamic Constraint Models for Planning and Scheduling Problems
Planning and scheduling attracts an unceasing attention of computer science community. However, despite of similar character of both tasks, in most current systems planning and sch...
Roman Barták
CCCG
2008
15 years 2 months ago
Application of computational geometry to network p-center location problems
In this paper we showed that a p( 2)-center location problem in general networks can be transformed to the well known Klee's measure problem [5]. This resulted in an improved...
Qiaosheng Shi, Binay K. Bhattacharya
SIGGRAPH
2010
ACM
15 years 5 months ago
Volume contact constraints at arbitrary resolution
We introduce a new method for simulating frictional contact between volumetric objects using interpenetration volume constraints. When applied to complex geometries, our formulati...
Jérémie Allard, François Faure, Hadrien Courtec...
RAID
2009
Springer
15 years 8 months ago
Towards Generating High Coverage Vulnerability-Based Signatures with Protocol-Level Constraint-Guided Exploration
Abstract. Signature-based input filtering is an important and widely deployed defense. But current signature generation methods have limited coverage and the generated signatures ...
Juan Caballero, Zhenkai Liang, Pongsin Poosankam, ...
ISTCS
1993
Springer
15 years 5 months ago
Analog Computation Via Neural Networks
We pursue a particular approach to analog computation, based on dynamical systems of the type used in neural networks research. Our systems have a xed structure, invariant in time...
Hava T. Siegelmann, Eduardo D. Sontag