Sciweavers

1431 search results - page 60 / 287
» The complexity of random ordered structures
Sort
View
WIA
2000
Springer
15 years 4 months ago
Solving Complex Problems Efficiently with Adaptive Automata
- Adaptive technologies are based on the self-modifying property of some systems, which give their users a very powerful and convenient facility for expressing and handling complex...
João José Neto
94
Voted
COLING
1992
15 years 1 months ago
Processing Complex Noun Phrases In A Natural Language Interface To A Statistical Database
Analysisof a corpus of queries to a statistical database has shown considerable variation in the location and order of modifiers in complex noun phrases. Nevertheless, restriction...
Fred Popowich, Paul McFetridge, Dan Fass, Gary Hal...
TSI
2008
89views more  TSI 2008»
15 years 13 days ago
RedGRID, un environnement pour la redistribution d'objets complexes
In the context of code coupling, efficient data redistribution is a crucial issue to reach high-performances. However, most of the works in this area have limited their studies to ...
Aurélien Esnard
IDEAL
2010
Springer
14 years 11 months ago
Applying Clustering Techniques to Reduce Complexity in Automated Planning Domains
Automated Planning is a very active area of research within Artificial Intelligence. Broadly this discipline deals with the methods by which an agent can independently determine t...
Luke Dicken, John Levine
WADS
1989
Springer
84views Algorithms» more  WADS 1989»
15 years 4 months ago
Skip Lists: A Probabilistic Alternative to Balanced Trees
rees can be used for representing abstract data types such as dictionaries and ordered lists. They work well when the elements are inserted in a random order. Some sequences of ope...
William Pugh