Sciweavers

2398 search results - page 365 / 480
» Constraint Programming and Graph Algorithms
Sort
View
ICALP
2007
Springer
15 years 11 months ago
Size Competitive Meshing Without Large Angles
We present a new meshing algorithm for the plane, Overlay Stitch Meshing (OSM), accepting as input an arbitrary Planar Straight Line Graph and producing a triangulation with all an...
Gary L. Miller, Todd Phillips, Donald Sheehy
PACT
2005
Springer
15 years 10 months ago
Information Flow Analysis for VHDL
We describe a fragment of the hardware description language VHDL that is suitable for implementing the Advanced Encryption Standard algorithm. We then define an Information Flow a...
Terkel K. Tolstrup, Flemming Nielson, Hanne Riis N...
PPSWR
2005
Springer
15 years 10 months ago
Descriptive Typing Rules for Xcerpt
We present typing rules for the Web query language Xcerpt. The rules provide a descriptive type system: the typing of a program is an ation of its semantics. The rules can also be ...
Sacha Berger, Emmanuel Coquery, Wlodzimierz Draben...
170
Voted
ICCS
2004
Springer
15 years 10 months ago
Routing and Wavelength Assignments in Optical WDM Networks with Maximum Quantity of Edge Disjoint Paths
In the present paper routing and wavelength assignment (RWA) in optical WDM networks is discussed. Previous techniques on based on the integer linear programming and graph coloring...
Hyunseung Choo, Vladimir V. Shakhov
SPAA
2003
ACM
15 years 10 months ago
Short length menger's theorem and reliable optical routing
In the minimum path coloring problem, we are given a graph and a set of pairs of vertices of the graph and we are asked to connect the pairs by colored paths in such a way that pa...
Amitabha Bagchi, Amitabh Chaudhary, Petr Kolman