Sciweavers

8196 search results - page 70 / 1640
» Computational Modeling and Complexity Science
Sort
View
COMPUTER
2004
54views more  COMPUTER 2004»
14 years 9 months ago
Modeling Complex Spoken Dialog
Hans Dybkjær, Laila Dybkjær
ICNC
2005
Springer
15 years 3 months ago
DNA Computing for Complex Scheduling Problem
Interest in DNA computing has increased overwhelmly since Adleman successfully demonstrated its capability to solve Hamiltonian Path Problem (HPP). Many research results of similar...
Mohd Saufee Muhammad, Zuwairie Ibrahim, Satomi Ued...
ICMT
2009
Springer
15 years 4 months ago
A Collection Operator for Graph Transformation
Abstract. Graph transformation has a well-established theory and associated tools that can be used to perform model transformations. However, the lack of a construct to match and t...
Roy Grønmo, Stein Krogdahl, Birger Mø...
ICTCS
2003
Springer
15 years 3 months ago
On the Computational Complexity of Cut-Elimination in Linear Logic
Abstract. Given two proofs in a logical system with a confluent cutelimination procedure, the cut-elimination problem (CEP) is to decide whether these proofs reduce to the same no...
Harry G. Mairson, Kazushige Terui
CIAC
2010
Springer
263views Algorithms» more  CIAC 2010»
15 years 7 months ago
The Complexity of Computing Minimal Unidirectional Covering Sets
Abstract. Given a binary dominance relation on a set of alternatives, a common thread in the social sciences is to identify subsets of alternatives that satisfy certain notions of ...
Dorothea Baumeister, Felix Brandt, Felix Fischer, ...