Sciweavers

91 search results - page 17 / 19
» Advice to Authors of Extended Abstracts
Sort
View
COCOA
2007
Springer
16 years 4 days ago
On the Complexity of Some Colorful Problems Parameterized by Treewidth
Abstract. We study the complexity of several coloring problems on graphs, parameterized by the treewidth t of the graph: (1) The list chromatic number χl(G) of a graph G is defin...
Michael R. Fellows, Fedor V. Fomin, Daniel Lokshta...
ICS
2007
Tsinghua U.
16 years 4 days ago
Representation-transparent matrix algorithms with scalable performance
Positive results from new object-oriented tools for scientific programming are reported. Using template classes, abstractions of matrix representations are available that subsume...
Peter Gottschling, David S. Wise, Michael D. Adams
ICS
2004
Tsinghua U.
15 years 11 months ago
Applications of storage mapping optimization to register promotion
Storage mapping optimization is a flexible approach to folding array dimensions in numerical codes. It is designed to reduce the memory footprint after a wide spectrum of loop tr...
Patrick Carribault, Albert Cohen
WOLLIC
2010
Springer
15 years 11 months ago
Modal Logics with Counting
Abstract. We present a modal language that includes explicit operators to count the number of elements that a model might include in the extension of a formula, and we discuss how ...
Carlos Areces, Guillaume Hoffmann, Alexandre Denis
CDC
2009
IEEE
176views Control Systems» more  CDC 2009»
15 years 10 months ago
Controllability of the rotation of a quantum planar molecule
Abstract— We consider the simplest model for controlling the rotation of a molecule by the action of an electric field, namely a quantum planar pendulum. This problem consists i...
Ugo V. Boscain, Thomas Chambrion, Paolo Mason, Mar...