Sciweavers

60 search results - page 2 / 12
» On the Effectiveness of Automatic Case Elicitation in a More...
Sort
View
TPDS
2002
126views more  TPDS 2002»
13 years 4 months ago
P-3PC: A Point-to-Point Communication Model for Automatic and Optimal Decomposition of Regular Domain Problems
One of the most fundamental problems automatic parallelization tools are confronted with is to find an optimal domain decomposition for a given application. For regular domain prob...
Frank J. Seinstra, Dennis Koelma
WSCG
2004
185views more  WSCG 2004»
13 years 6 months ago
Automatic Fitting and Control of Complex Freeform Shapes in 3-D
In many computer graphics and computer-aided design problems, it is very common to find a smooth and well structured surface to fit a set of unstructured 3-dimensional data. Altho...
Yu Song, Joris S. M. Vergeest, Chensheng Wang
AUSAI
2008
Springer
13 years 7 months ago
Exploiting Ontological Structure for Complex Preference Assembly
When a user is looking for a product recommendation they usually lack expert knowledge regarding the items they are looking for. Ontologies on the other hand are crafted by experts...
Gil Chamiel, Maurice Pagnucco
ATAL
2008
Springer
13 years 7 months ago
Content-oriented composite service negotiation with complex preferences
In e-commerce, for some cases the service requested by the consumer cannot be fulfilled by the producer. In such cases, service consumers and producers need to negotiate their ser...
Reyhan Aydogan
ISSRE
2003
IEEE
13 years 10 months ago
A New Software Testing Approach Based on Domain Analysis of Specifications and Programs
Partition testing is a well-known software testing technique. This paper shows that partition testing strategies are relatively ineffective in detecting faults related to small sh...
Ruilian Zhao, Michael R. Lyu, Yinghua Min