Machine Learning and History

I’ve had this idea for doing clustering and data mining of history texts.  Would be interesting to creating learning algorithms that can learn timelines and context.  Essentially history textbooks are structured possibly geographically and as a time series of events.  Then doing graphical analysis and social analysis on these structures.  Could compare history texts and… Continue reading Machine Learning and History

MAS applications

I found this journal Practical Applications of Agents and Multi-Agent Systems and their list of publications and conference proceedings here.  They look like a very neat conference.  I took a look at their most recent proceedings and found to my delight that they have some cool applications that I’m interested in and make me think that some… Continue reading MAS applications

Master Theses

This is an interesting approach to masters theses, they list them on their website!

Decision Theory Paradoxes

I’ve been researching decision theory paradoxes because in my Bounty’s task allocation system I am considering the benefits of giving the bondsman the decision to allocate particular tasks through an auction (ie exclusive) or through its normal bounty (non-exclusive) method.  This brings with it a potentially multi-criteria decision which has me interested about the theoretical ramifications… Continue reading Decision Theory Paradoxes

Multi-team Systems

A multi team system consists of multiple teams where each team may have their own goals, but system in general has a common ultimate goal http://en.wikipedia.org/wiki/Multiteam_system.  This is really interesting.  I think that this would be an interesting direction to move bounties. Also, on a different note, I think that a survey of this field would… Continue reading Multi-team Systems

Repairmen and Trees

I think I have finally found a problem that has not been studied and is important.  I’m calling it the K-D-Traveling Repairman Problem.  K, the number of repairmen, D, the number of types of repairmen.  The repairman problem is a NP-hard problem and therefore heurstics are used to solve it.  The Predictics group at CMU… Continue reading Repairmen and Trees

Voting and Auction based Monitors

Condition variables and monitors go hand in hand.  There are various monitor protocols: Signal-and-Continue (SC), Signal-and-Urgent-Wait (SU), Signal-and-Exit, Urgent-Signal-and-Continue etc.  Basically these protocols define what order threads get to enter, reenter, and exit methods in a monitor.  They are defined by a first-come first-served (FCFS) queuing schemes to ensure their specific protocols are met. I… Continue reading Voting and Auction based Monitors