Sciweavers

4047 search results - page 709 / 810
» Some Properties and Some Problems on Set Functors
Sort
View
HPCC
2007
Springer
15 years 10 months ago
Hybrid Line Search for Multiobjective Optimization
Abstract. The aggregation of objectives in multiple criteria programming is one of the simplest and widely used approach. But it is well known that these techniques sometimes fail ...
Crina Grosan, Ajith Abraham
SIGECOM
2003
ACM
125views ECommerce» more  SIGECOM 2003»
15 years 9 months ago
Complexity of determining nonemptiness of the core
Coalition formation is a key problem in automated negotiation among self-interested agents, and other multiagent applications. A coalition of agents can sometimes accomplish thing...
Vincent Conitzer, Tuomas Sandholm
SWAT
2010
Springer
302views Algorithms» more  SWAT 2010»
15 years 9 months ago
A Weakly Robust PTAS for Minimum Clique Partition in Unit Disk Graphs
We consider the problem of partitioning the set of vertices of a given unit disk graph (UDG) into a minimum number of cliques. The problem is NP-hard and various constant factor a...
Imran A. Pirwani, Mohammad R. Salavatipour
EWCBR
1998
Springer
15 years 8 months ago
On Bayesian Case Matching
Abstract. Case retrieval is an important problem in several commercially signi cant application areas, such as industrial con guration and manufacturing problems. In this paper we ...
Petri Kontkanen, Petri Myllymäki, Tomi Siland...
COCOON
2006
Springer
15 years 8 months ago
Reconstructing Evolution of Natural Languages: Complexity and Parameterized Algorithms
In a recent article, Nakhleh, Ringe and Warnow introduced perfect phylogenetic networks--a model of language evolution where languages do not evolve via clean speciation--and form...
Iyad A. Kanj, Luay Nakhleh, Ge Xia