Sciweavers

933 search results - page 82 / 187
» Fully automatic cross-associations
Sort
View
AGP
2003
IEEE
15 years 11 months ago
Time Equations for Lazy Functional (Logic) Languages
There are very few approaches to measure the execution costs of lazy functional (logic) programs. The use of a lazy execution mechanism implies that the complexity of an evaluation...
Elvira Albert, Josep Silva, Germán Vidal
ESAW
2003
Springer
15 years 11 months ago
Competent Agents and Customising Protocols
Abstract. In open agent societies, communication protocols and strategies cannot be assumed to always match perfectly, because they are typically specified by different designers...
Ulrich Endriss, Wenjin Lu, Nicolas Maudet, Kostas ...
ICSE
2003
IEEE-ACM
15 years 11 months ago
Data Flow Testing as Model Checking
This paper presents a model checking-based approach to data flow testing. We characterize data flow oriented coverage criteria in temporal logic such that the problem of test ge...
Hyoung Seok Hong, Sung Deok Cha, Insup Lee, Oleg S...
VISUALIZATION
2002
IEEE
15 years 11 months ago
Maximum Entropy Light Source Placement
Finding the “best” viewing parameters for a scene is quite difficult but a very important problem. Fully automatic procedures seem to be impossible as the notion of “best...
Stefan Gumhold
MAMMO
2010
Springer
15 years 11 months ago
Lesion Segmentation in Breast Sonography
Abstract. Sonography is gaining popularity as an adjunct screening technique for assessing abnormalities in the breast. This is particularly true in cases where the subject has den...
Joan Massich, Fabrice Meriaudeau, Elsa Pére...