Sciweavers

1477 search results - page 173 / 296
» Complexity of (iterated) dominance
Sort
View
ATAL
2006
Springer
15 years 4 months ago
Examining DCSP coordination tradeoffs
Distributed Constraint Satisfaction Problems (DCSPs) provide a model to capture a broad range of cooperative multiagent problem solving settings. Researchers have generally propos...
Michael Benisch, Norman M. Sadeh
SOFSEM
2000
Springer
15 years 4 months ago
Exhaustive Search, Combinatorial Optimization and Enumeration: Exploring the Potential of Raw Computing Power
For half a century since computers came into existence, the goal of finding elegant and efficient algorithms to solve "simple" (welldefined and well-structured) problems ...
Jürg Nievergelt
APSEC
2007
IEEE
15 years 7 months ago
Incentive Compatible Mechanisms for Group Ticket Allocation in Software Maintenance Services
A customer reported problem (or Trouble Ticket) in software maintenance is typically solved by one or more maintenance engineers. The decision of allocating the ticket to one or m...
Karthik Subbian, Ramakrishnan Kannan, Raghav Kumar...
83
Voted
BMCBI
2006
140views more  BMCBI 2006»
15 years 25 days ago
Feature selection using Haar wavelet power spectrum
Background: Feature selection is an approach to overcome the 'curse of dimensionality' in complex researches like disease classification using microarrays. Statistical m...
Prabakaran Subramani, Rajendra Sahu, Shekhar Verma
116
Voted
TECS
2008
119views more  TECS 2008»
15 years 21 days ago
Fast exploration of bus-based communication architectures at the CCATB abstraction
straction SUDEEP PASRICHA and NIKIL DUTT University of California, Irvine and MOHAMED BEN-ROMDHANE Newport Media Inc. Currently, system-on-chip (SoC) designs are becoming increasin...
Sudeep Pasricha, Nikil Dutt, Mohamed Ben-Romdhane