Sciweavers

655 search results - page 77 / 131
» Conversationally Relevant Descriptions
Sort
View
DELTA
2004
IEEE
14 years 1 months ago
Arithmetic Transformations to Maximise the Use of Compressor Trees
Complex arithmetic computations, especially if derived from bit-level software descriptions, can be very inefficient if implemented directly in hardware (e.g., by translation of t...
Paolo Ienne, Ajay K. Verma
CEAS
2006
Springer
14 years 1 months ago
An Email and Meeting Assistant Using Graph Walks
We describe a framework for representing email as well as meeting information as a joint graph. In the graph, documents and meeting descriptions are connected via other nontextual...
Einat Minkov, William W. Cohen
GECCO
2006
Springer
124views Optimization» more  GECCO 2006»
14 years 1 months ago
Rotated test problems for assessing the performance of multi-objective optimization algorithms
This paper presents four rotatable multi-objective test problems that are designed for testing EMO (Evolutionary Multiobjective Optimization) algorithms on their ability in dealin...
Antony W. Iorio, Xiaodong Li
RTA
2000
Springer
14 years 1 months ago
Parallelism Constraints
Parallelism constraints are logical descriptions of trees. Parallelism constraints subsume dominance constraints and are equal in expressive power to context unification. Paralleli...
Katrin Erk, Joachim Niehren
DLOG
2008
14 years 8 days ago
All Elephants are Bigger than All Mice
Abstract. We investigate the concept product as an expressive feature for description logics (DLs). While this construct allows us to express an arguably very common and natural ty...
Sebastian Rudolph, Markus Krötzsch, Pascal Hi...