2636 search results - page 488 / 528 » Linear Programming |
FOCS
2009
IEEE
15 years 4 months ago
2009
IEEE
Given a set A of m agents and a set I of n items, where agent A ∈ A has utility uA,i for item i ∈ I, our goal is to allocate items to agents to maximize fairness. Specificall...
ICASSP
2009
IEEE
15 years 4 months ago
2009
IEEE
Abstract—Hyperspectral unmixing aims at identifying the hidden spectral signatures (or endmembers) and their corresponding proportions (or abundances) from an observed hyperspect...
INFOCOM
2009
IEEE
15 years 4 months ago
2009
IEEE
—We introduce a novel protection scheme, called Cooperative Fast Protection (CFP), to fight against a single link failure in survivable WDM (Wavelength Division Multiplexing) mes...
ATAL
2009
Springer
2009
Springer
Effective solutions for real-world Stackelberg games: when agents must deal with human uncertainties
15 years 4 months ago
How do we build multiagent algorithms for agent interactions with human adversaries? Stackelberg games are natural models for many important applications that involve human intera...
EMSOFT
2009
Springer
15 years 4 months ago
2009
Springer
The major obstacle to use multicores for real-time applications is that we may not predict and provide any guarantee on real-time properties of embedded software on such platforms...