Sciweavers

3273 search results - page 275 / 655
» types 2007
Sort
View
JGAA
2008
97views more  JGAA 2008»
15 years 7 months ago
Drawing Bipartite Graphs on Two Parallel Convex Curves
Let G be a bipartite graph, and let e, i be two parallel convex curves; we study the question about whether G admits a planar straight-line drawing such that the vertices of one p...
Emilio Di Giacomo, Luca Grilli, Giuseppe Liotta
CIA
2007
Springer
16 years 1 months ago
A Generic Framework for Argumentation-Based Negotiation
Past years have witnessed a growing interest in automated negotiation as a coordination mechanism for interacting agents. This paper presents a generic, problem- and domain-indepen...
Markus M. Geipel, Gerhard Weiss
AAECC
2007
Springer
87views Algorithms» more  AAECC 2007»
15 years 7 months ago
Towards an accurate performance modeling of parallel sparse factorization
We present a simulation-based performance model to analyze a parallel sparse LU factorization algorithm on modern cached-based, high-end parallel architectures. We consider supern...
Laura Grigori, Xiaoye S. Li
HPCC
2007
Springer
16 years 1 months ago
Optimizing Array Accesses in High Productivity Languages
One of the outcomes of DARPA’s HPCS program has been the creation of three new high productivity languages: Chapel, Fortress, and X10. While these languages have introduced impro...
Mackale Joyner, Zoran Budimlic, Vivek Sarkar
CORR
2007
Springer
217views Education» more  CORR 2007»
15 years 7 months ago
Hard constraint satisfaction problems have hard gaps at location 1
An instance of the maximum constraint satisfaction problem (Max CSP) is a nite collection of constraints on a set of variables, and the goal is to assign values to the variables ...
Peter Jonsson, Andrei A. Krokhin, Fredrik Kuivinen