Sciweavers

3318 search results - page 59 / 664
» The Weak Instance Model
Sort
View
EJC
2007
13 years 9 months ago
Comparing the Use of Feature Structures in Nativism and in Database Semantics
Linguistics has always been a field with a great diversity of schools and sub-schools. This has naturally led to the question of whether different grammatical analyses of the sam...
Roland Hausser
SODA
2000
ACM
120views Algorithms» more  SODA 2000»
13 years 9 months ago
Minimum ratio canceling is oracle polynomial for linear programming, but not strongly polynomial, even for networks
This paper shows that the minimum ratio canceling algorithm of Wallacher (1989) (and a faster relaxed version) can be generalized to an algorithm for general linear programs with ...
S. Thomas McCormick, Akiyoshi Shioura
AE
2005
Springer
14 years 1 months ago
Evolutionary Design of a DDPD Model of Ligation
Ligation is a form of chemical self-assembly that involves dynamic formation of strong covalent bonds in the presence of weak associative forces. We study an extremely simple form ...
Mark A. Bedau, Andrew Buchanan, Gianluca Gazzola, ...
JAIR
2002
182views more  JAIR 2002»
13 years 7 months ago
An Analysis of Phase Transition in NK Landscapes
In this paper, we analyze the decision version of the NK landscape model from the perspective of threshold phenomena and phase transitions under two random distributions, the unif...
Yong Gao, Joseph C. Culberson
CISIS
2009
IEEE
14 years 2 months ago
Creating Visualizations through Ontology Mapping
We explore how to support the creation of customized visualizations of ontology instance data through the specification of ontology mappings. We combine technologies from the dis...
Sean M. Falconer, R. Ian Bull, Lars Grammel, Marga...