Sciweavers

5263 search results - page 842 / 1053
» Open Constraint Optimization
Sort
View
FOCS
2008
IEEE
16 years 1 months ago
Beating the Random Ordering is Hard: Inapproximability of Maximum Acyclic Subgraph
We prove that approximating the Max Acyclic Subgraph problem within a factor better than 1/2 is Unique-Games hard. Specifically, for every constant ε > 0 the following holds:...
Venkatesan Guruswami, Rajsekar Manokaran, Prasad R...
ISCAS
2008
IEEE
217views Hardware» more  ISCAS 2008»
16 years 1 months ago
Approximate L0 constrained non-negative matrix and tensor factorization
— Non-negative matrix factorization (NMF), i.e. V ≈ WH where both V, W and H are non-negative has become a widely used blind source separation technique due to its part based r...
Morten Mørup, Kristoffer Hougaard Madsen, L...
RTSS
2007
IEEE
16 years 1 months ago
Energy-Aware Scheduling of Real-Time Tasks in Wireless Networked Embedded Systems
Recent technological advances have opened up several distributed real-time applications involving battery-driven embedded devices with local processing and wireless communication ...
G. Sudha Anil Kumar, G. Manimaran
ERCIMDL
2005
Springer
80views Education» more  ERCIMDL 2005»
16 years 17 days ago
Strategies for Reprocessing Aggregated Metadata
The OAI protocol facilitates the aggregation of large numbers of heterogeneous metadata records. In order to make harvested records useable in the context of an OAI service provide...
Muriel Foulonneau, Timothy W. Cole
ICWE
2005
Springer
16 years 17 days ago
Modelling the Behaviour of Web Applications with ArgoUWE
A methodology needs to be empowered by appropriate tool support. The CASE tool ArgoUWE supports designers in the use of the UWE methodology for the systematic, UML-based developmen...
Alexander Knapp, Nora Koch, Gefei Zhang