Sciweavers

5606 search results - page 994 / 1122
» Randomization Techniques for Graphs.
Sort
View
IEEEPACT
2005
IEEE
15 years 12 months ago
Communication Optimizations for Fine-Grained UPC Applications
Global address space languages like UPC exhibit high performance and portability on a broad class of shared and distributed memory parallel architectures. The most scalable applic...
Wei-Yu Chen, Costin Iancu, Katherine A. Yelick
KBSE
2005
IEEE
15 years 12 months ago
Generation of visual editors as eclipse plug-ins
Visual Languages (VLs) play an important role in software system development. Especially when looking at well-defined domains, a broad variety of domain specific visual language...
Karsten Ehrig, Claudia Ermel, Stefan Hänsgen,...
AIED
2005
Springer
15 years 12 months ago
Tradeoff analysis between knowledge assessment approaches
Abstract: The problem of modeling and assessing an individual’s ability level is central to learning environments. Numerous approaches exists to this end. Computer Adaptive Testi...
Michel Desmarais, Shunkai Fu, Xiaoming Pu
AOSE
2005
Springer
15 years 12 months ago
Improving AOSE with an Enriched Modelling Framework
Many approaches and tools assist the various tasks required to develop a multi-agent system (MAS), yet there still remains a gap between the generation of MAS models and program co...
Richard Hill, Simon Polovina, Martin D. Beer
APPROX
2005
Springer
150views Algorithms» more  APPROX 2005»
15 years 12 months ago
A Primal-Dual Approximation Algorithm for Partial Vertex Cover: Making Educated Guesses
We study the partial vertex cover problem. Given a graph G = (V, E), a weight function w : V → R+ , and an integer s, our goal is to cover all but s edges, by picking a set of v...
Julián Mestre