Sciweavers

5210 search results - page 1015 / 1042
» Exact geometric computation
Sort
View
ICALP
2005
Springer
14 years 2 months ago
Approximation Algorithms for the Max-coloring Problem
Given a graph G = (V, E) and positive integral vertex weights w : V → N, the max-coloring problem seeks to find a proper vertex coloring of G whose color classes C1, C2, . . . ,...
Sriram V. Pemmaraju, Rajiv Raman
ISAAC
2005
Springer
127views Algorithms» more  ISAAC 2005»
14 years 2 months ago
Decision Making Based on Approximate and Smoothed Pareto Curves
Abstract. We consider bicriteria optimization problems and investigate the relationship between two standard approaches to solving them: (i) computing the Pareto curve and (ii) the...
Heiner Ackermann, Alantha Newman, Heiko Rögli...
MMMACNS
2005
Springer
14 years 2 months ago
Networks, Markov Lie Monoids, and Generalized Entropy
The continuous general linear group in n dimensions can be decomposed into two Lie groups: (1) an n(n-1) dimensional ‘Markov type’ Lie group that is defined by preserving the ...
Joseph E. Johnson
TACAS
2005
Springer
108views Algorithms» more  TACAS 2005»
14 years 2 months ago
On Some Transformation Invariants Under Retiming and Resynthesis
Transformations using retiming and resynthesis operations are the most important and practical (if not the only) techniques used in optimizing synchronous hardware systems. Althoug...
Jie-Hong Roland Jiang
ATAL
2005
Springer
14 years 2 months ago
Optimal status sets of heterogeneous agent programs
There are many situations where an agent can perform one of several sets of actions in responses to changes in its environment, and the agent chooses to perform the set of actions...
Bogdan Stroe, V. S. Subrahmanian, Sudeshna Dasgupt...
« Prev « First page 1015 / 1042 Last » Next »