Sciweavers

757 search results - page 63 / 152
» On the hardness of approximating Max-Satisfy
Sort
View
GD
2007
Springer
15 years 4 months ago
Moving Vertices to Make Drawings Plane
In John Tantalo’s on-line game Planarity the player is given a non-plane straight-line drawing of a planar graph. The aim is to make the drawing plane as quickly as possible by m...
Xavier Goaoc, Jan Kratochvíl, Yoshio Okamot...
MFCS
2007
Springer
15 years 4 months ago
On the Complexity of Computing Treelength
We resolve the computational complexity of determining the treelength of a graph, thereby solving an open problem of Dourisboure and Gavoille, who introduced this parameter, and a...
Daniel Lokshtanov
ISCAS
2005
IEEE
125views Hardware» more  ISCAS 2005»
15 years 3 months ago
A novel algorithm of spatial scalability for scrambled video
Although many researches have investigated transparent scrambling video techniques, an issue of which transcoding relates to downsizing scrambled video without unscrambling has ha...
YuanZhi Zou, Wen Gao
GECCO
2004
Springer
122views Optimization» more  GECCO 2004»
15 years 3 months ago
Gradient-Based Learning Updates Improve XCS Performance in Multistep Problems
This paper introduces a gradient-based reward prediction update mechanism to the XCS classifier system as applied in neuralnetwork type learning and function approximation mechani...
Martin V. Butz, David E. Goldberg, Pier Luca Lanzi
CAV
2009
Springer
116views Hardware» more  CAV 2009»
15 years 2 months ago
Priority Scheduling of Distributed Systems Based on Model Checking
Priorities are used to control the execution of systems to meet given requirements for optimal use of resources, e.g., by using scheduling policies. For distributed systems, it is ...
Ananda Basu, Saddek Bensalem, Doron Peled, Joseph ...