3625 search results - page 591 / 725 » On choosing |
206
click to vote
SAGT
2009
Springer
16 years 1 months ago
2009
Springer
In a scheduling game, each player owns a job and chooses a machine to execute it. While the social cost is the maximal load over all machines (makespan), the cost (disutility) of ...
214
click to vote
SARA
2009
Springer
16 years 1 months ago
2009
Springer
We study novel approaches for solving of hard combinatorial problems by translation to Boolean Satisfiability (SAT). Our focus is on combinatorial problems that can be represented...
195
click to vote
SEMWEB
2009
Springer
16 years 1 months ago
2009
Springer
In this report, we give a brief explanation of how RiMOM obtains the results at OAEI 2009 Campaign, especially in the new Instance Matching track. At first, we show the basic alig...
182
click to vote
CASES
2009
ACM
16 years 1 months ago
2009
ACM
Embedded systems are often implemented on FPGA devices and 25% of the time [2] include a soft processor— a processor built using the FPGA reprogrammable fabric. Because of their...
203
click to vote
DOCENG
2009
ACM
16 years 1 months ago
2009
ACM
In this paper we propose a novel approach to markup, called Extreme Annotational RDF Markup (EARMARK), using RDF and OWL to annotate features in text content that cannot be mapped...