Discrete optimization problemsarise throughout many real world domainsincluding planning, decision making, and search. NP-hardin general, these problems require novel approachesto...
The dense nonsymmetric eigenproblem is one of the hardest linear algebra problems to solvee ectively on massivelyparallel machines. Rather than trying to design a black box" ...
Abstract. Many combinatorial optimization problems can be formulated as 0/1 integer programs (0/1 IPs). The investigation of the structure of these problems raises the following ta...
The Data Interoperability Problem appears in contexts where consumers need to peruse data owned by producers, and the syntax and/or semantics of such data—at both end points—ar...
The Grid promise is starting to materialize today: largescale multi-site infrastructures have grown to assist the work of scientists from all around the world. This tremendous gro...