MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for "Hard combinators." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

134 documents found, showing 1 through 10. Next 10 →

ATOM

Framelets - Small and Loosely Coupled Frameworks
by Wolfgang Pree, Kai Koskimies — 1999 — ACM Computing Survey Symposium on Application Frameworks (Ed.: M. Fayad
… is usually not compatible so that two or more frameworks can hardly be combined. As alternative we propose…
Cited by 1 (0 self) – Add To MetaCart

Reducing the Cost of Group Communication with Semantic View Synchrony
by José Pereira, Luís Rodrigues, Rui Oliveira — 2002 — In Proceedings of the International Conference on Dependable Systems and Networks (DSN
… to maintain consistency across membership changes. However, experience indicates that it is hard to combine…
Cited by 1 (1 self) – Add To MetaCart

Lightweight GUIs for Functional Programming
by Ton Vullinghs, Daniel Tuijnman, Wolfram Schulte — 1995 — In Proceedings of the Seventh International Symposium on Programming Languages, Implementations, Logics and Programs
…,daniel,wolframg@(email omitted); Abstract. Graphical user interfaces (GUIs) are hard to combine with functional programming. Using a…
Cited by 16 (1 self) – Add To MetaCart

The "Write Once, Deploy N" MDA Case Study - Combining Performance Tuning with Vendor Independence
by Pieter Van Gorp
… Independence Optimizing the performance of distributed database applications is hard to combine with middleware…
Add To MetaCart

Framelets—Small and Loosely Coupled Frameworks
by Wolfgang Pree, Kai Koskimies — 1999 — ACM Computing Survey Symposium on Application Frameworks (Ed.: M. Fayad
… is usually not compatible so that two or more frameworks can hardly be combined. As alternative we propose…
Cited by 1 (0 self) – Add To MetaCart

Integrating and querying parallel leaf shape descriptions
by Shenghui Wang, Jeff Z. Pan — 2006 — In Proceedings of International Semantic Web Conference (ISWC2006
… information systems — it is hard to combine new information with any other piece of related information we…
Cited by 1 (1 self) – Add To MetaCart

Simulation for Project Administration
by Fredrick von Schoultz, Aimo Törn — 1995
… and are therefore hard to combine. The SuperVision project strives to create such an integrated environment designed…
Add To MetaCart

Language and Conceptual Development series
by Lisa Feigenson Stanislas, Stanislas Dehaene, Elizabeth Spelke — 2004
… is mathematics both so easy and so hard? Combined efforts from developmental psychology, psychophysics…
Add To MetaCart

Approximating the Shortest Watchman Route in a Simple Polygon
by Svante Carlsson, Håkan Jonsson, Bengt J. Nilsson — 1993 — In Proc. 4th Annu. Internat. Sympos. Algorithms Comput., volume 762 of Lecture Notes Comput. Sci
… the Traveling Salesperson Problem) that are NP-hard. The combined problem, to ��nd the shortest closed curve…
Cited by 5 (0 self) – Add To MetaCart

A 2-Approximation Algorithm for Finding an Optimum 3-Vertex-Connected Spanning Subgraph
by Vinchenzo Auletta, Yefim Dinitz, Zeev Nutov, D. Parente — 1999 — J. Algorithms
…, this problem is known to be NP-hard. Combining properties of inclusionminimal k-vertex connected graphs…
Cited by 22 (8 self) – Add To MetaCart

Showing 1 through 10. Next 10 →

ATOM

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB