Abstract The

Parallel implementations of genetic algorithms (GAs) are common, and, in most cases, they succeed to reduce the time required to find acceptable solutions. However, the effect of the parameters of parallel GAs on the quality of their search and on their efficiency are not well understood

We present a simple new algorithm for triangulating polygons and planar straightline graphs. It provides "shape" and "size" guarantees: All triangles have a bounded aspect ratio. The number of triangles is within a constant factor of optimal. Such "quality

desire loses some of its appeal. Direct reports of subjective well-being may have a useful role in the measurement of consumer preferences and social welfare, if they can be done in a credible way. Indeed, economists have already made much use of subjective well-being data. From 2001 to 2005, more than

SVM training is a convex optimization problem which scales with the training set size rather than the feature space dimension. While this is usually considered to be a desired quality, in large scale problems it may cause training to be impractical. The common techniques to handle this difficulty

(single-dimensional) approaches. Often this flexibility leads to higher-quality anonymizations, as measured both by general-purpose metrics, as well as more specific notions of query answerability. In this paper, we prove that optimal multidimensional anonymization is NP-hard (like previous k

are particularly important are described, together with specific benefits (like trust) and task outcomes (like improved learning) known to be associated with relationship quality. We especially consider the problem of designing for longterm interaction, and define relational agents as computational artifacts

We study the role of pricing policies in multiple service class networks. We first argue that some form of serviceclass sensitive pricing is required for any multiclass service discipline ’ to attain the desired level of performance. Borrowing heavily from the Nash implementation paradigm

Keyphrases are an important means of document summarization, clustering, and topic search. Only a small minority of documents have author-assigned keyphrases, and manually assigning keyphrases to existing documents is very laborious. Therefore it is highly desirable to automate the keyphrase

In heterogeneous environments with performance variations present, multiple applications compete and share a limited amount of system resources, and su#er from variations in resource availability. These complex applications are desired to adapt themselves and to adjust their resource demands