Sciweavers

2887 search results - page 30 / 578
» Name Generation and Linearity
Sort
View
PARA
2004
Springer
15 years 11 months ago
A Model-Order Reduction Technique for Low Rank Rational Perturbations of Linear Eigenproblems
Large and sparse rational eigenproblems where the rational term is of low rank k arise in vibrations of fluid–solid structures and of plates with elastically attached loads. Exp...
Frank Blömeling, Heinrich Voss
EOR
2006
104views more  EOR 2006»
15 years 5 months ago
An linear programming based lower bound for the simple assembly line balancing problem
The simple assembly line balancing problem is a classical integer programming problem in operations research. A set of tasks, each one being an indivisible amount of work requirin...
Marc Peeters, Zeger Degraeve
ORDER
2006
99views more  ORDER 2006»
15 years 5 months ago
Countably Complementable Linear Orderings
We say that a countable linear ordering L is countably complementable if there exists a linear ordering L, possibly uncountable, such that for any countable linear ordering B, L do...
Antonio Montalbán
CODES
2005
IEEE
15 years 11 months ago
An integer linear programming approach for identifying instruction-set extensions
This paper presents an Integer Linear Programming (ILP) approach to the instruction-set extension identification problem. An algorithm that iteratively generates and solves a set...
Kubilay Atasu, Günhan Dündar, Can C. &Ou...
ECAI
2010
Springer
15 years 6 months ago
Linear Logic for Non-Linear Storytelling
Whilst narrative representations have played a prominent role in AI research, there has been a renewed interest in the topic with the development of interactive narratives. A typic...
Anne-Gwenn Bosser, Marc Cavazza, Ronan Champagnat