Sciweavers

78 search results - page 6 / 16
» Beyond static and dynamic scope
Sort
View
ICFP
2010
ACM
15 years 5 months ago
ReCaml: execution state as the cornerstone of reconfigurations
Most current techniques fail to achieve the dynamic update of recursive functions. A focus on execution states appears to be essential in order to implement dynamic update in this...
Jérémy Buisson, Fabien Dagnat
IFIP
2004
Springer
15 years 10 months ago
Service Location and Multiparty Peering for Mobile Ad Hoc Communication
Abstract. Flexible personal communications may require dynamically discovering, using, and combining a number of services to support the activities of a mobile user. However, many ...
Dirk Kutscher, Jörg Ott
NPIV
1998
ACM
117views Visualization» more  NPIV 1998»
15 years 9 months ago
Data Object and Label Placement For Information Abundant Visualizations
Placing numerous data objects and their corresponding labels in limited screen space is a challenging problem in information visualization systems. Extending map-oriented techniqu...
Jia Li, Catherine Plaisant, Ben Shneiderman
PODS
1994
ACM
138views Database» more  PODS 1994»
15 years 9 months ago
Dyn-FO: A Parallel, Dynamic Complexity Class
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...
Sushant Patnaik, Neil Immerman
ICFP
2005
ACM
16 years 5 months ago
Dynamic optimization for functional reactive programming using generalized algebraic data types
A limited form of dependent types, called Generalized Algebraic Data Types (GADTs), has recently been added to the list of Haskell extensions supported by the Glasgow Haskell Comp...
Henrik Nilsson