Sciweavers

1559 search results - page 101 / 312
» Fundamentals of Generic Programming
Sort
View
CONSTRAINTS
2004
116views more  CONSTRAINTS 2004»
14 years 9 months ago
Decision Tradeoff Using Example-Critiquing and Constraint Programming
We consider constructive preference elicitation for decision aid systems in applications such as configuration or electronic catalogs. We are particularly interested in supporting ...
Pearl Pu, Boi Faltings
ECOOP
2004
Springer
15 years 3 months ago
The Expression Problem Revisited
The expression problem (aka the extensibility problem) refers to a fundamental dilemma of programming: Can your application be structured in such a way that both the data model and...
Mads Torgersen
COMPGEOM
2005
ACM
14 years 11 months ago
Multi-pass geometric algorithms
We initiate the study of exact geometric algorithms that require limited storage and make only a small number of passes over the input. Fundamental problems such as lowdimensional...
Timothy M. Chan, Eric Y. Chen
SIGPLAN
2008
14 years 9 months ago
Languages and performance engineering: method, instrumentation, and pedagogy
Programs encounter increasingly complex and fragile mappings to computing platforms, resulting in performance characteristics that are often mysterious to students, practitioners,...
Doug Lea, David F. Bacon, David Grove
MOBIHOC
2001
ACM
15 years 9 months ago
Localized algorithms in wireless ad-hoc networks: location discovery and sensor exposure
The development of practical, localized algorithms is probably the most needed and most challenging task in wireless ad-hoc sensor networks (WASNs). Localized algorithms are a spe...
Seapahn Meguerdichian, Sasha Slijepcevic, Vahag Ka...