Sciweavers

521 search results - page 16 / 105
» Reduction Strategies and Acyclicity
Sort
View
ANLP
2000
110views more  ANLP 2000»
13 years 9 months ago
Arabic Morphology Generation Using a Concatenative Strategy
Arabic inflectional morphology requires infixation, prefixation and suffixation, giving rise to a large space of morphological variation. In this paper we describe an approach to ...
Violetta Cavalli-Sforza, Abdelhadi Soudi, Teruko M...
SMI
2006
IEEE
141views Image Analysis» more  SMI 2006»
14 years 2 months ago
Degree Reduction for NURBS Symbolic Computation on Curves
Symbolic computation of NURBS plays an important role in many areas of NURBS-based geometric computation and design. However, any nontrivial symbolic computation, especially when ...
Xianming Chen, Richard F. Riesenfeld, Elaine Cohen
JFP
2008
72views more  JFP 2008»
13 years 8 months ago
Dynamic rebinding for marshalling and update, via redex-time and destruct-time reduction
Most programming languages adopt static binding, but for distributed programming an exclusive reliance on static binding is too restrictive: dynamic binding is required in various...
Peter Sewell, Gareth Stoyle, Michael Hicks, Gavin ...
IPPS
1999
IEEE
14 years 11 days ago
A Genetic-Based Fault-Tolerant Routing Strategy for Multiprocessor Networks
Abstract. We have investigated the adaptation of AI-based search techniques as topologyindependent fault-tolerant routing strategies on multiprocessor networks [9]. The results sho...
Peter K. K. Loh, Venson Shaw
MFCS
2010
Springer
13 years 6 months ago
Parity Games with Partial Information Played on Graphs of Bounded Complexity
Abstract. We address the strategy problem for parity games with partial information and observable colors, played on finite graphs of bounded graph complexity. We consider several...
Bernd Puchala, Roman Rabinovich