Sciweavers

36 search results - page 3 / 8
» Solving Satisfiability Problems on FPGAs using Experimental ...
Sort
View
CIKM
2006
Springer
13 years 9 months ago
Heuristic containment check of partial tree-pattern queries in the presence of index graphs
The wide adoption of XML has increased the interest of the database community on tree-structured data management techniques. Querying capabilities are provided through tree-patter...
Dimitri Theodoratos, Stefanos Souldatos, Theodore ...
WEA
2010
Springer
250views Algorithms» more  WEA 2010»
13 years 10 months ago
Randomized Rounding for Routing and Covering Problems: Experiments and Improvements
We investigate how the recently developed different approaches to generate randomized roundings satisfying disjoint cardinality constraints behave when used in two classical algori...
Benjamin Doerr, Marvin Künnemann, Magnus Wahl...
CONSTRAINTS
2002
111views more  CONSTRAINTS 2002»
13 years 5 months ago
A Constraint-Based Interactive Train Rescheduling Tool
In this paper, we report the design and implementation of a constraint-based interactive train rescheduling tool, a project in collaboration with the International Institute for So...
C. K. Chiu, C. M. Chou, Jimmy Ho-Man Lee, Ho-fung ...
EOR
2006
66views more  EOR 2006»
13 years 5 months ago
Multi-period capacity expansion for a local access telecommunications network
In this paper, we examine a multi-period capacity expansion problem for a local access telecommunications network with a tree topology. Capacity expansion is realized through the ...
Michel Gendreau, Jean-Yves Potvin, Ali Smires, Pat...
IJAIT
2008
99views more  IJAIT 2008»
13 years 5 months ago
Optimal Basic Block Instruction Scheduling for Multiple-Issue Processors Using Constraint Programming
Instruction scheduling is one of the most important steps for improving the performance of object code produced by a compiler. A fundamental problem that arises in instruction sch...
Abid M. Malik, Jim McInnes, Peter van Beek