Sciweavers

706 search results - page 32 / 142
» An Integer Linear Programming Approach to Database Design
Sort
View
ENDM
2006
69views more  ENDM 2006»
14 years 11 months ago
Timetabling problems at the TU Eindhoven
The students of the Industrial Design department at the TU Eindhoven are allowed to design part of their curriculum by selecting courses from a huge course pool. They do this by ha...
John van den Broek, Cor A. J. Hurkens, Gerhard J. ...
61
Voted
EUSFLAT
2003
206views Fuzzy Logic» more  EUSFLAT 2003»
15 years 14 days ago
Analysis of multi-product break-even with uncertain information
We revise the classic methodology to find the multi-product break-even point. In the current paper we propose a solution to the problem under uncertainty conditions, based on Dur...
Luisa L. Lazzari, María Silvia Moriñ...
IPPS
2009
IEEE
15 years 5 months ago
High-level estimation and trade-off analysis for adaptive real-time systems
We propose a novel design estimation method for adaptive streaming applications to be implemented on a partially reconfigurable FPGA. Based on experimental results we enable accu...
Ingo Sander, Jun Zhu, Axel Jantsch, Andreas Herrho...
ISSAC
2007
Springer
131views Mathematics» more  ISSAC 2007»
15 years 5 months ago
Some recent progress in exact linear algebra and related questions
We describe some major recent progress in exact and symbolic linear algebra. These advances concern the improvement of complexity estimates for fundamental problems such as linear...
Gilles Villard
FAW
2007
Springer
177views Algorithms» more  FAW 2007»
15 years 5 months ago
The Parameterized Complexity of the Induced Matching Problem in Planar Graphs
Abstract. Given a graph G and a nonnegative integer k, the NP-complete Induced Matching problem asks for an edge subset M such that M is a matching and no two edges of M are joined...
Hannes Moser, Somnath Sikdar