Sciweavers

828 search results - page 40 / 166
» Bounded Hairpin Completion
Sort
View
MST
2011
231views Hardware» more  MST 2011»
12 years 10 months ago
On the Complexity of Matroid Isomorphism Problem
We study the complexity of testing if two given matroids are isomorphic. The problem is easily seen to be in Σ p 2. In the case of linear matroids, which are represented over pol...
B. V. Raghavendra Rao, Jayalal M. N. Sarma
CADE
2012
Springer
11 years 10 months ago
A Simplex-Based Extension of Fourier-Motzkin for Solving Linear Integer Arithmetic
Abstract. This paper describes a novel decision procedure for quantifierfree linear integer arithmetic. Standard techniques usually relax the initial problem to the rational domai...
François Bobot, Sylvain Conchon, Evelyne Co...
AIPS
2011
12 years 11 months ago
Effective Heuristics and Belief Tracking for Planning with Incomplete Information
Conformant planning can be formulated as a path-finding problem in belief space where the two main challenges are the heuristics to guide the search, and the representation and u...
Alexandre Albore, Miquel Ramírez, Hector Ge...
AIPS
2011
12 years 11 months ago
Scheduling an Aircraft Repair Shop
We address a scheduling problem in the context of military aircraft maintenance where the goal is to meet the aircraft requirements for a number of missions in the presence of bre...
Maliheh Aramon Bajestani, J. Christopher Beck
HPDC
2011
IEEE
12 years 11 months ago
Juggle: proactive load balancing on multicore computers
We investigate proactive dynamic load balancing on multicore systems, in which threads are continually migrated to reduce the impact of processor/thread mismatches to enhance the ...
Steven Hofmeyr, Juan A. Colmenares, Costin Iancu, ...