Sciweavers

421 search results - page 68 / 85
» Exact and Heuristic Algorithms for the Weapon-Target Assignm...
Sort
View
JMLR
2012
11 years 10 months ago
Conditional Likelihood Maximisation: A Unifying Framework for Information Theoretic Feature Selection
We present a unifying framework for information theoretic feature selection, bringing almost two decades of research on heuristic filter criteria under a single theoretical inter...
Gavin Brown, Adam Pocock, Ming-Jie Zhao, Mikel Luj...
GC
2007
Springer
13 years 7 months ago
Precoloring Extension of Co-Meyniel Graphs
The pre-coloring extension problem consists, given a graph G and a set of nodes to which some colors are already assigned, in finding a coloring of G with the minimum number of co...
Vincent Jost, Benjamin Lévêque, Fr&ea...
STOC
2006
ACM
92views Algorithms» more  STOC 2006»
14 years 8 months ago
On the importance of idempotence
Range searching is among the most fundamental problems in computational geometry. An n-element point set in Rd is given along with an assignment of weights to these points from so...
Sunil Arya, Theocharis Malamatos, David M. Mount
ICTAI
1994
IEEE
13 years 11 months ago
A Distributed Scheduling Framework
A distributed problem solving approach to job shop scheduling is described in this paper. The approach views the system as an Organisation. Agents are assigned di erent roles and ...
Carla P. Gomes, Austin Tate, Lyn Thomas
SASO
2008
IEEE
14 years 2 months ago
Towards Desynchronization of Multi-hop Topologies
In this paper we study desynchronization, a closelyrelated primitive to graph coloring. A valid graph coloring is an assignment of colors to nodes such that no node’s color is t...
Julius Degesys, Radhika Nagpal