Sciweavers

1802 search results - page 76 / 361
» Complexity Theory for Operators in Analysis
Sort
View
AI
2010
Springer
15 years 6 months ago
Optimal query complexity bounds for finding graphs
We consider the problem of finding an unknown graph by using two types of queries with an additive property. Given a graph, an additive query asks the number of edges in a set of ...
Sung-Soon Choi, Jeong Han Kim
SIGECOM
2003
ACM
125views ECommerce» more  SIGECOM 2003»
15 years 11 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
AI
2006
Springer
15 years 6 months ago
Complexity of constructing solutions in the core based on synergies among coalitions
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
SMI
2005
IEEE
15 years 11 months ago
Maximizing Adaptivity in Hierarchical Topological Models
We present an approach to hierarchically encode the topology of functions over triangulated surfaces. We describe the topology of a function by its Morse-Smale complex, a well kno...
Peer-Timo Bremer, Valerio Pascucci, Bernd Hamann
CICLING
2003
Springer
15 years 11 months ago
Starting with Complex Primitives Pays Off
In setting up a formal system to specify a grammar formalism, the conventional (mathematical) wisdom is to start with primitives (basic primitive structures) as simple as possible...
Aravind K. Joshi